Scribd
Upload
35 views18 pages

Optimization Based Algorithms

This document discusses optimization algorithms for facility location problems. It presents formulations of the p-median problem and Boctor's formulation. The p-median problem aims to minimize the distance between facilities and customers by finding the optimal location of p facilities. It can be formulated as an optimization problem with constraints. Boctor's formulation explicitly minimizes inter-facility moves by classifying machines and parts concurrently. The example shows applying these formulations to a distance matrix to optimally locate two facilities.

Uploaded by

RicardoGarzón
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views18 pages

Optimization Based Algorithms

This document discusses optimization algorithms for facility location problems. It presents formulations of the p-median problem and Boctor's formulation. The p-median problem aims to minimize the distance between facilities and customers by finding the optimal location of p facilities. It can be formulated as an optimization problem with constraints. Boctor's formulation explicitly minimizes inter-facility moves by classifying machines and parts concurrently. The example shows applying these formulations to a distance matrix to optimally locate two facilities.

Uploaded by

RicardoGarzón
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

Optimization Based

Algorithms
FIM-EPN-2018
How does optimization works for
this?
OPTIMIZATION
• That can be formulated as an optimization
problem
• With the objective of minimizing distance
• This is called a p-median problem
THE FORMULATION GOES LIKE THIS
• Given a distance matrix

Decision
variables

Constrains
OBJECTIVE
CHECK IF OUR FORMULATION IS OK
 
 
 

0= 𝑋 25 ≤ 𝑋 55= 0
OBJECTIVE
FINAL SOLUTION
EXAMPLE OF APLICATION

DISTANCE MATRIX
• P median formulation has 36 variables and 37 constraints
• For p=2, the solution is X11 = X31 =X41 = X55 =X25 =X65=1
with Z=7
• The machines groups are [1,3,4] and [5,2,6]
• For p=3, the solution is X11=X31=X41=X22=X52=X66=1 with
Z=4

• For p=2
• The machines groups are [1,3,4] and [5,2,6]
• , the solution is X11 = X31 =X41 = X55 =X25 =X65=1
• Part 1 visits machines 1,3,4 and 6 and goes to group 1
• Part 2 visits machines 2, 5 and 6 and goes to groups 2
Issues with p-median
• P is given. It is not a variable
• There exists algorithms of p as a variable
• P median does not minimizes IC moves
ANOTHER OPTIMIZATION – BOCTOR´S
FORMULATION
• Let Xik =1 if machine i is assigned to group k
• Let Yjk =1 if part j is assigned to group k
 

• Subjected to 𝑝 𝑝

∑ 𝑌 𝑗𝑘 =1 ∑ 𝑋 𝑖𝑘=1
𝑘=1 𝑘=1
Another form of Boctor´s
 

Restrict the cell size

0 otherwise
BOCTOR´S FORMULATION
• Explicitly minimize intercell moves
• Classify machine and parts at the same time
• Classify machine and parts concurrently
• OBJECTIVE minimize intercell moves
For our example
• For P = 2
• The optimum solution is
• X11 = X31 = X41 = X22 = X52 = X62 = 1
• Y11= Y41 = Y51 = Y61 = Y22 = Y32= Y72 = Y82 =1
• Z262=Z261 = Z551=Z552 = Z611=Z612=Z641=Z642=1
• This means that there are four intercell moves M2-P6,
M5-P5, M6-P1 and M6-P4
• This is the solution obtained using the p median model
for p=2
Heuristic Optimization
Algorithms Algorithms
PFA P-median

ROC Boctors

Similarity based

Non Hierarchical

You might also like