Scribd
Upload
691 views22 pages

Quantitative Models (Chp10)

QUANTITATIVE FACILITIES PLANNING MODELS Dr. Muzaffer Kapanoglu - Production Systems and Facilities Planning (c) 2004 RECTILINEAR FACILITY LOCATION PROBLEM LOCATION-ALLOCATION MODELS WAREHOUSE / PLANT LAYOUT MODELS SPECIAL LAYOUT - QUADRATIC ASSIGNMENT PROBLEM - wrehouse / plant Location model.

Uploaded by

Ruchika Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
691 views22 pages

Quantitative Models (Chp10)

QUANTITATIVE FACILITIES PLANNING MODELS Dr. Muzaffer Kapanoglu - Production Systems and Facilities Planning (c) 2004 RECTILINEAR FACILITY LOCATION PROBLEM LOCATION-ALLOCATION MODELS WAREHOUSE / PLANT LAYOUT MODELS SPECIAL LAYOUT - QUADRATIC ASSIGNMENT PROBLEM - wrehouse / plant Location model.

Uploaded by

Ruchika Verma
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

QUANTITATIVE FACILITIES PLANNING MODELS

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

FACILITY LOCATION MODELS


RECTILINEAR FACILITY LOCATION PROBLEM n-FACILITY LOCATION PROBLEM LOCATION-ALLOCATION MODELS WAREHOUSE/PLANT LOCATION MODEL

SPECIAL FACILITY LAYOUT MODELS


QUADRATIC ASSIGNMENT PROBLEM WAREHOUSE LAYOUT MODELS MACHINE LAYOUT MODELS

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Distances
Rectilinear Distance Euclidean Distance Flow Path Distance (Actual path traversed between two points)

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Rectilinear Facility Location


X=(x,y): Location of the new facility Pi =(ai, bi): Location of existing facility i i=1,2,..m wi : Weight associated between the new facility and existing facility i d(X, Pi) = Distance between the new facility and the existing facility i Optimization opportunities

min f ( x) wi d ( X , Pi )
i 1
Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Rectilinear Facility Location


SINGLE-FACILITY MINISUM LOCATION PROBLEM

min f ( x) wi X ai wi Y bi
i 1 i 1

SINGLE-FACILITY with EUCLIDEAN??

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Rectilinear Facility Location


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Iso-cost contour lines


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Iso-cost contour lines


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Iso-cost contour lines


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Iso-cost contour lines


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Iso-cost contour lines


SINGLEFACILITY MINISUM LOCATION PROBLEM
What if we have only a few of alternative locations?

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Rectilinear Facility Location


SINGLE-FACILITY MINISUM LOCATION PROBLEM Problem 10.1 Location of existing facilities: P1(0,10), P2(5,10), P3(5,15), P4(10, 5). Weights: w1: 15, w2: 20, w3: 5, w4: 30. Determine the optimum location for a single new facility when cost is proportional to rectilinear distance. Construct a contour line passing through the point (10, 10).

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Rectilinear Facility Location


SINGLE-FACILITY MINIMAX LOCATION PROBLEM
min f ( x) max ( X ai Y bi ), i 1,2,..m

Linearize?? Optimization?? C1=minimum(ai + bi) C2=maximum(ai + bi) C3=minimum(- ai + bi) C4=maximum( - ai + bi) C5=max(c2 - c1, c4 - c3) (x1,y1)=0.5(c1-c3, c1+c3+c5) (x2,y2)=0.5(c2-c4, c2+c4-c5)
Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

n-Facility Location

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Location-Allocation Models

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Location-Allocation Models

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Warehouse Location Problem

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Quadratic Assignment Problem

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Quadratic Assignment Problem

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Warehouse Layout Models

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Warehouse Layout Models

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

Warehouse Layout Models

Dr. Muzaffer Kapanolu Production Systems and Facilities Planning 2004

You might also like