9780470905364

Network and Discrete Location Models, Algorithms, and Applications

by
  • ISBN13:

    9780470905364

  • ISBN10:

    0470905360

  • Edition: 2nd
  • Format: Hardcover
  • Copyright: 2013-08-19
  • Publisher: Wiley

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $145.00 Save up to $14.50
  • Rent Book $130.50
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE
    USUALLY SHIPS IN 3-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
  • The Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

Praise for the First Edition
This book is refreshing to read since it takes an important topic...
and presents it in a clear and concise manner by using examples that include visual presentations of the problem, solution methods, and results along with an explanation of the mathematical and procedural steps required to model the problem and work through to a solution.” —Journal of Classification

Thoroughly updated and revised, Network and Discrete Location: Models, Algorithms, and Applications, Second Edition remains the go-to guide on facility location modeling. The book offers a unique introduction to methodological tools for solving location models and provides insight into when each approach is useful and what information can be obtained.

The Second Edition focuses on real-world extensions of the basic models used in locating facilities, including production and distribution systems, location-inventory models, and defender-interdictor problems. A unique taxonomy of location problems and models is also presented. Featuring examples using the author’s own software—SITATION, MOD-DIST, and MENU-OKF—as well as Microsoft Office® Excel®, the book provides: 

• A theoretical and applied perspective on location models and algorithms
• An intuitive presentation of the uses and limits of modeling techniques
• An introduction to integrated location-inventory modeling and defender-interdictor models for the design of reliable facility location systems
• A full range of exercises to equip readers with an understanding of the basic facility location model types 

Network and Discrete Location: Models, Algorithms, and Applications, Second Edition is an essential resource for practitioners in applied and discrete mathematics, operations research, industrial engineering, and quantitative geography. The book is also a useful textbook for upper-level undergraduate, graduate, and MBA courses.

Author Biography

MARK S. DASKIN, PhD, is Clyde W. Johnson Collegiate Professor of Industrial and Operations Engineering as well as Department Chair at the University of Michigan. Dr. Daskin is the former editor-in-chief of both Transportation Science and IIE Transactions and continues to serve on the editorial boards of both journals. He is also on the editorial board of the IIE Transactions on Healthcare Systems Engineering and is the author of the award-winning book Service Science, also published by Wiley.

Table of Contents

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

Rewards Program

Write a Review