Plant Location & Layout: Factors, Models & Design

Why Plant Location Matters

Plant location is the foundation of operations strategy. A poor choice can lead to:

• Higher costs: Transport, labor, or energy expenses (e.g., a factory in remote Pokhara may need to pay 20% more for electricity than Kathmandu).
• Supply chain delays: Long lead times for raw materials or finished goods (e.g., a textile factory in Biratnagar vs. Dharan).
• Regulatory risks: Zoning laws, environmental permits, or tax incentives (e.g., Nepal’s Industrial Enterprise Act 2020 offers subsidies for factories in least-developed regions).
• Reputation damage: Pollution or noise complaints (e.g., a cement plant near a residential area in Lalitpur).

Key Factors in Plant Location Decisions

Decisions are made using a weighted scoring model (quantitative) or checklist approach (qualitative). Below is a comparison table of critical factors:

Worked Example: Nabil Bank’s ATM Location Strategy Nabil Bank uses a center-of-gravity model to place ATMs in Kathmandu:

1. Data: Population density (2023 census), existing branches, foot traffic (Google Maps data).
2. Calculation:
   • Assign weights: Population (40%), Branch proximity (30%), Traffic (20%), Safety (10%).
   • Plot Kathmandu on a grid, calculate weighted coordinates: $$X=\frac{\sum (x_i\times w_i)}{\sum w_i},Y=\frac{\sum (y_i\times w_i)}{\sum w_i}$$
   • Optimal location: Near Thapathali (high population + branch density).
3. Result: Reduced average customer travel time by 30% vs. random placement.

Plant Location Models

Three quantitative models help standardize decisions:

1. Center-of-Gravity Method

• Best for: Single-product firms with known demand/shipping costs.
• Steps:
  1. Plot demand points (cities) on a coordinate system.
  2. Calculate weighted average of X and Y coordinates.
  3. Optimal location = $(X,Y)$.
• Limitation: Ignores qualitative factors (e.g., labor laws).

flowchart TD
  A["Start: Identify demand points (D1, D2, ..., Dn)"] --> B["Assign weights (e.g., demand volume)"]
  B --> C["Calculate weighted X-coordinate: \(X = \frac{\sum (x_i \times w_i)}{\sum w_i}\)"]
  C --> D["Calculate weighted Y-coordinate: \(Y = \frac{\sum (y_i \times w_i)}{\sum w_i}\)"]
  D --> E["Plot (X, Y) on map"]
  E --> F["Validate with qualitative factors"]

2. Transportation Model (Linear Programming)

• Best for: Multi-product firms with fixed factories and warehouses.

• Example: Daraz’s order fulfillment network.

  • Objective: Minimize total transport cost.
  • Constraints: Supply ≤ factory capacity, demand ≥ warehouse capacity.

• Worked Example: Suppose Daraz has 2 factories (Kathmandu, Pokhara) and 3 warehouses (Lalitpur, Bhaktapur, Chitwan). Shipping costs (per unit) are:

  From\To	Lalitpur	Bhaktapur	Chitwan
  Kathmandu	5	7	10
  Pokhara	12	15	3

  Demand: Lalitpur (500 units), Bhaktapur (300), Chitwan (200). Supply: Kathmandu (600), Pokhara (400). Solution: Use northwest corner rule or Vogel’s approximation method to find optimal shipments.

3. Factor-Rating Method

• Best for: Qualitative-heavy decisions (e.g., call centers).
• Steps:
  1. List 5–10 factors (e.g., labor cost, internet speed).
  2. Assign weights (e.g., labor cost = 30%).
  3. Rate each location (1–10) per factor.
  4. Calculate weighted score.

Example: Pathao’s rider hub location in Kathmandu.

• Factors: Traffic congestion (weight: 35%), fuel cost (25%), safety (20%), internet (20%).
• Scores:

  Location	Traffic	Fuel	Safety	Internet	Total
  Thapathali	8	7	6	9	7.95
  Koteshwor	5	9	8	7	7.35

Plant Layout Types

Layout design affects throughput, safety, and flexibility. Four primary types:

Systematic Layout Planning (SLP)

A 6-step methodology to design layouts efficiently:

mindmap
  root((SLP: Systematic Layout Planning))
    Step 1["Define Objectives"]
      - Minimize material handling
      - Improve safety
      - Reduce lead time
    Step 2["Gather Data"]
      - Product flow diagrams
      - From-To chart (frequency of moves between departments)
    Step 3["Develop Relationship Chart"]
      - A: Absolutely necessary
      - E: Especially important
      - I: Important
      - O: Ordinary
      - U: Unimportant
      - X: Undesirable
    Step 4["Develop Space Relationship Diagram"]
      - Block diagrams showing proximity needs
    Step 5["Develop Layout Alternatives"]
      - Sketch 3–5 options
    Step 6["Evaluate and Select"]
      - Use cost-volume analysis
      - Simulate with software (e.g., AutoCAD, FlexSim)

Worked Example: Kathmandu Traffic Police’s Vehicle Parking Layout

1. Objective: Reduce response time for emergencies.
2. From-To Chart:
   • Highest flow: Dispatch → Ambulance Bay (50 trips/day).
   • Lowest: Dispatch → Motorcycle Parking (5 trips/day).
3. Relationship Chart:
   • Dispatch & Ambulance Bay: A (Absolutely Necessary).
   • Dispatch & Motorcycle Parking: U (Unimportant).
4. Final Layout:
   • Place Dispatch and Ambulance Bay adjacent, with motorcycle parking farthest.

In the Real World

1. Daraz’s Multi-City Warehousing

   • Idea Used: Center-of-gravity model + transportation cost matrix.
   • How: Daraz operates 3 mega-warehouses (Kathmandu, Pokhara, Biratnagar) to minimize last-mile delivery costs. Their algorithm dynamically routes orders based on real-time traffic data (from Google Maps API) and inventory levels.

2. Himalayan Java’s Chitwan Factory

   • Idea Used: Proximity to raw materials + government incentives.
   • How: Located in Chitwan (near coffee-growing regions) to reduce transport costs for green beans. The factory also benefits from Nepal’s Industrial Enterprise Act 2020, which offers 10% tax breaks for agro-based industries in rural areas.

3. NTC’s Telecom Tower Locations

   • Idea Used: Factor-rating method + infrastructure constraints.
   • How: NTC uses a weighted scoring system to place towers:
     • Terrain difficulty: 30% (avoid hills without concrete foundations).
     • Population density: 25% (prioritize urban areas).
     • Electricity availability: 20% (backup generators for remote sites).
     • Safety: 15% (distance from schools/hospitals).
     • Competitor presence: 10% (avoid oversupply).
   • Result: 95% coverage in Kathmandu Valley with 20% lower OPEX than random placement.

Case Study: Toyota Kirloskar Motor’s Nepal Plant (Bhaktapur)

Challenge: Toyota needed a location that balanced:

• Proximity to Kathmandu market (80% of sales).
• Government incentives (Bhaktapur offers 5-year tax holiday).
• Labor availability (skilled auto mechanics in Valley).

Solution:

1. Location: Bhaktapur Industrial Zone (15 km from Kathmandu).
2. Layout:
   • Product layout for assembly line (Innova cars).
   • Cellular layout for spare parts manufacturing.
3. Outcome:
   • 30% lower transport costs vs. a Terai location.
   • 20% faster assembly time due to optimized layout.
   • Avoided labor strikes by locating near technical institutes.

Exam Tip

1. For theoretical questions (e.g., "Explain factors affecting plant location"):

   • Use the weighted scoring table format.
   • Always include Nepal-specific examples (e.g., Daraz, NTC, Himalayan Java).
   • Link to costs: "Proximity to markets reduces transport costs by X%."

2. For numerical problems (e.g., center-of-gravity or transportation model):

   • Show all calculations step-by-step.
   • Assume data if missing: "Assume demand at Lalitpur = 500 units, Bhaktapur = 300 units..."
   • Interpret results: "The optimal location is near Thapathali, reducing delivery time by 30%."

3. For layout design questions:

   • Describe the SLP steps in order.
   • Draw a simple diagram (even in exam, sketch a box layout).
   • Compare two layouts: "Product layout is better for high-volume items, but process layout is more flexible."

4. Common pitfalls:

   • Ignoring qualitative factors (e.g., labor unions, pollution laws).
   • Forgetting Nepal’s unique constraints (e.g., land ownership laws, unreliable power).
   • Not linking location/layout to strategy (e.g., "Toyota chose Bhaktapur for market proximity and tax breaks").

Pro Tip: Memorize the 6 steps of SLP and the center-of-gravity formula. Examiners love questions on real-world applications—practice with Daraz, NTC, or Himalayan Java cases.