Network and Discrete Location

Wysyłka: Niedostępna
Sugerowana cena detaliczna 475,65 PLN
Nasza cena: 460,91 PLN
Oszczędzasz 3%
Dodaj do Schowka
Zaloguj się
Przypomnij hasło
×
×
Darmowa dostawa
Oferujemy szeroki asortyment - ponad 120 tys. produktów
Dysponujemy solidną wiedzą - działamy już 11 lat
Dbamy o wybór najcenniejszych tytułów

Opis: Network and Discrete Location - Mark S. Daskin

This Second Edition remains the only hands-on guide to using and developing facility location models. It offers a practice-oriented introduction to model-building methods and solution algorithms complete with software for solving classical problems of realistic size and end-of-chapter exercises to enhance reader understanding. The book introduces readers to the key classical location problems (covering, center, median, and fixed charge); discusses real-world extensions of the basic models used in locating; outlines a host of methodological tools for solving location models; and much more.1 Introduction to Location Theory and Models 1.1 INTRODUCTION 1.2 KEY QUESTIONS ADDRESSED BY LOCATION MODELS 1.3 EXAMPLE PROBLEM DESCRIPTIONS 1.3.1 Ambulance Location 1.3.2 Siting Landfills for Hazardous Wastes 1.3.3 Summary 1.4 KEY DIMENSIONS OF LOCATION PROBLEMS AND MODELS 1.4.1 Planar versus Network versus Discrete Location Models 1.4.2 Tree Problems versus General Graph Problems 1.4.3 Distance Metrics 1.4.4 Number of Facilities to Locate 1.4.5 Static versus Dynamic Location Problems 1.4.6 Deterministic versus Probabilistic Models 1.4.7 Single- versus Multiple-Product Models 1.4.8 Private versus Public Sector Problems 1.4.9 Single-versus Multiple-Objective Problems and Models 1.4.10 Elastic versus Inelastic Demand 1.4.11 Capacitated versus Uncapacitated Facilities 1.4.12 Nearest Facility versus General Demand Allocation Models 1.4.13 Hierarchical versus Single-Level Models 1.4.14 Desirable versus Undesirable Facilities 1.5 A TAXONOMY OF LOCATION MODELS 1.5.1 Typology of location models 1.5.2 A simple analytic model 1.6 SUMMARY 1.7 EXERCISES Figure 1.1 Typical tradeoff in maximum covering model Figure 1.2 Dispatching options in a multi-tiered system Figure 1.3 Example trees and graphs Figure 1.4 Alternative Taxonomy of Location Models Figure 1.5 Service area and directions of travel for a simple analytic location model Figure 1.6 Example service region subdivided into 9 subregions Figure 1.7 Typical cost components in a simple analytic model Figure 1.8 Ratio of actual to optimal cost versus ratio of actual to optimal number of facilities for the simple analytic model Table 1.1 Allowable range of alpha for various percentage errors in the optimal cost for the simple analytic model


Szczegóły: Network and Discrete Location - Mark S. Daskin

Tytuł: Network and Discrete Location
Autor: Mark S. Daskin
Producent: Blackwell Science
ISBN: 9780470905364
Rok produkcji: 2013
Ilość stron: 536
Oprawa: Twarda


Recenzje: Network and Discrete Location - Mark S. Daskin

Zaloguj się
Przypomnij hasło
×
×

Network and Discrete Location

This Second Edition remains the only hands-on guide to using and developing facility location models. It offers a practice-oriented introduction to model-building methods and solution algorithms complete with software for solving classical problems of realistic size and end-of-chapter exercises to enhance reader understanding. The book introduces readers to the key classical location problems (covering, center, median, and fixed charge); discusses real-world extensions of the basic models used in locating; outlines a host of methodological tools for solving location models; and much more.1 Introduction to Location Theory and Models 1.1 INTRODUCTION 1.2 KEY QUESTIONS ADDRESSED BY LOCATION MODELS 1.3 EXAMPLE PROBLEM DESCRIPTIONS 1.3.1 Ambulance Location 1.3.2 Siting Landfills for Hazardous Wastes 1.3.3 Summary 1.4 KEY DIMENSIONS OF LOCATION PROBLEMS AND MODELS 1.4.1 Planar versus Network versus Discrete Location Models 1.4.2 Tree Problems versus General Graph Problems 1.4.3 Distance Metrics 1.4.4 Number of Facilities to Locate 1.4.5 Static versus Dynamic Location Problems 1.4.6 Deterministic versus Probabilistic Models 1.4.7 Single- versus Multiple-Product Models 1.4.8 Private versus Public Sector Problems 1.4.9 Single-versus Multiple-Objective Problems and Models 1.4.10 Elastic versus Inelastic Demand 1.4.11 Capacitated versus Uncapacitated Facilities 1.4.12 Nearest Facility versus General Demand Allocation Models 1.4.13 Hierarchical versus Single-Level Models 1.4.14 Desirable versus Undesirable Facilities 1.5 A TAXONOMY OF LOCATION MODELS 1.5.1 Typology of location models 1.5.2 A simple analytic model 1.6 SUMMARY 1.7 EXERCISES Figure 1.1 Typical tradeoff in maximum covering model Figure 1.2 Dispatching options in a multi-tiered system Figure 1.3 Example trees and graphs Figure 1.4 Alternative Taxonomy of Location Models Figure 1.5 Service area and directions of travel for a simple analytic location model Figure 1.6 Example service region subdivided into 9 subregions Figure 1.7 Typical cost components in a simple analytic model Figure 1.8 Ratio of actual to optimal cost versus ratio of actual to optimal number of facilities for the simple analytic model Table 1.1 Allowable range of alpha for various percentage errors in the optimal cost for the simple analytic model

Powiadom o dostępności
Podaj swój e-mail a zostaniesz poinformowany jak tylko pozycja będzie dostępna.
×
Cena 475,65 PLN
Nasza cena 460,91 PLN
Oszczędzasz 3%
Wysyłka: Niedostępna
Dodaj do Schowka
Zaloguj się
Przypomnij hasło
×
×

Darmowa dostawa
Zaloguj się
Przypomnij hasło
×
×
Dodane do koszyka
×