# Operations research : Deterministic Models

Anonymous
account_balance_wallet \$60

### Question Description

assignment is to write a research paper using Microsoft Word with a minimum of 1500 words and a maximum of 2500 words

The research topic is “Single Facility Euclidean Location Problem

The full instructions for the research paper is uploaded as PDF.

### Unformatted Attachment Preview

Thomas574
School: Carnegie Mellon University

Will submit in the next 3 hours as agreed.
Attached.

Running head: SINGLE FACILITY EUCLIDEAN LOCATION PROBLEM

Euclidean Location Problem
Name
Professor
Institution
Course
Date

1

SINGLE FACILITY EUCLIDEAN LOCATION PROBLEM

2

Abstract
This research paper delves into the challenge of locating a single facility Euclidean with
several points available. The paper, however, restricts itself to Euclidean distances only as opposed
to the distances. They include Rectilinear and Squared Euclidean. The purpose of conducting the
research is to try and find ways of minimizing the total costs of location and subsequent
relocations. To achieve this end, this research paper develops an algorithm that uses three criteria
in determining the best suited ways. The three criteria are the most suitable location/point, the
amount of time for relocation and the subsequent costs involved in shifting the points. The points
of location are determined through constant weights, the period of relocation and the BIP model
developed. In determining the time allocation, the period spend is not fixed. Among the key areas
that will be discussed in the research paper are: - Literature review, examples of algorithm/
heuristic methodology/ how it works and explanation of the algorithm usage of heuristic as far as
single facility Euclidean location problem is concerned.
Keywords: Location, Algorithm, Single Facility Euclidean, Discrete Horizon

SINGLE FACILITY EUCLIDEAN LOCATION PROBLEM

3

Introduction
Singe facility location is a type of management decision making strategy. When addressing
complex decisions and scenarios, researchers use multiple or single facility approach. Most of the
problems solved through facility location are p-center and p-median problems. To address
complexness in these problems, the idea of facility location and heuristic methods is considered.
Alternatively, complexness in these problems may be solved using rectilinear, Euclidean distances
or squared Euclidean algorithmic models (Casteigts, 2013).
Where to precisely locate infrastructure/facility is a key decision that has to be made by
any communications firm or company. The decision is howeve...

flag Report DMCA
Review

Anonymous
Good stuff. Would use again.

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors