M tech ( PEM) Standard Book for JUT

 

M.Tech (Project Engineering & Management) – JUT Ranchi

Recommended Books 

Version 1.0 (Final) | Based on JUT Syllabus & International Academic Standards

---

Objective

top two recommended books for every major subject in the M.Tech (Project Engineering & Management) curriculum. The recommendations are based on:

• International academic reputation
• Industry relevance
• Research usefulness
• Suitability for semester examinations
• Dissertation and publication support
• Long-term professional value

---

Subject-wise Final Book Recommendations

S. No.	Subject	🥇 First Choice (Highly Recommended)	🥈 Second Choice
1	Financial Planning & Management	Prasanna Chandra – Projects: Planning, Analysis, Selection, Financing, Implementation and Review	S.C. Kuchhal – Financial Management
2	Decision Making & Optimization	Douglas C. Montgomery – Design and Analysis of Experiments	Ranjit Kumar – Research Methodology
3	Agile Project Management	Charles G. Cobb – Making Sense of Agile Project Management	Robert K. Wysocki – Effective Project Management
4	Software Engineering	Ian Sommerville – Software Engineering	Roger S. Pressman – Software Engineering: A Practitioner's Approach
5	Operations & Production Management	B. Mahadevan – Operations Management: Theory and Practice	R. Panneerselvam – Production and Operations Management
6	Construction Project Management	K.K. Chitkara – Construction Project Management	Kumar Neeraj Jha – Construction Project Management: Theory and Practices
7	Project Management	Clifford F. Gray & Erik W. Larson – Project Management: The Managerial Process	John M. Nicholas & Herman Steyn – Project Management for Business and Technology
8	Human Factors & Industrial Management	Sanders & McCormick – Human Factors in Engineering and Design	S.K. Basu, K.C. Sahu & Rajiv B. – Industrial Organisation and Management
9	Business Planning & Strategy	Paul Elkins – Mastering Business Planning and Strategy	George Stonehouse – Global and Transnational Business: Strategy and Management
10	Management Information Systems	Kenneth C. Laudon – Management Information Systems	Joseph M. Putti – Management: A Functional Approach
11	Intelligent Manufacturing	Andrew Kusiak – Intelligent Manufacturing Systems	Mikell P. Groover – Automation, Production Systems and Computer-Integrated Manufacturing
12	Research Methodology	Ranjit Kumar – Research Methodology	Stuart Melville & Wayne Goddard – Research Methodology for Science & Engineering Students
13	Industry 4.0 & Cloud Computing	Alasdair Gilchrist – Industry 4.0: The Industrial Internet of Things	Ibrahim Garbie – Sustainability in Manufacturing Enterprises
14	E-Commerce*	Verify the actual JUT syllabus authors. The names "Jane Smith" and "John Doe" appear to be placeholders rather than real prescribed authors.	Use the officially prescribed author once confirmed.
15	Energy Management	W.C. Turner – Energy Management Handbook	Hamies – Energy Auditing and Conservation
16	Product Design & Development	Karl T. Ulrich & Steven D. Eppinger – Product Design and Development	Kevin Otto & Kristin Wood – Product Design: Techniques in Reverse Engineering and New Product Development
17	Design of Experiments & Green Manufacturing	Douglas C. Montgomery – Design and Analysis of Experiments	David A. Dornfeld – Green Manufacturing: Fundamentals and Applications

---

Final Top 10 Books for the Entire M.Tech (PEM)

These are the most valuable books if you wish to build a high-quality personal reference library.

Rank	Book
🥇 1	Clifford F. Gray & Erik W. Larson – Project Management: The Managerial Process
🥈 2	Douglas C. Montgomery – Design and Analysis of Experiments
🥉 3	Ian Sommerville – Software Engineering
4	Charles G. Cobb – Making Sense of Agile Project Management
5	B. Mahadevan – Operations Management: Theory and Practice
6	Ranjit Kumar – Research Methodology
7	Karl T. Ulrich & Steven D. Eppinger – Product Design and Development
8	Alasdair Gilchrist – Industry 4.0: The Industrial Internet of Things
9	Andrew Kusiak – Intelligent Manufacturing Systems
10	W.C. Turner – Energy Management Handbook

---

Buying Recommendations

• Buy the latest available edition unless your university specifically prescribes an older edition.
• Prefer Indian low-price editions from Pearson India, McGraw Hill India, Wiley India, Springer India, or PHI when available.
• For rare or out-of-print titles, consider university libraries or reputable second-hand book sellers.
• Verify the author, title, and edition with the official JUT syllabus before purchasing.

---

Recommended Purchase Priority

Phase I (Essential Core Library)

1. Project Management – Gray & Larson
2. Design and Analysis of Experiments – Montgomery
3. Software Engineering – Sommerville
4. Research Methodology – Ranjit Kumar
5. Operations Management – B. Mahadevan

Phase II (Specialization)

6. Agile Project Management – Charles G. Cobb
7. Product Design and Development – Ulrich & Eppinger
8. Industry 4.0 – Alasdair Gilchrist
9. Intelligent Manufacturing Systems – Andrew Kusiak
10. Energy Management Handbook – W.C. Turner

Phase III (Advanced Reference)

11. Construction Project Management – K.K. Chitkara
12. Human Factors in Engineering and Design – Sanders & McCormick
13. Management Information Systems – Kenneth C. Laudon
14. Business Planning & Strategy – Paul Elkins
15. Green Manufacturing – David A. Dornfeld

---

Final Note

This refreshed document consolidates all the book recommendations you shared during this conversation into a single, organized reference. The only item that should be verified against the official JUT syllabus is the E-Commerce entry, because the listed names ("Jane Smith" and "John Doe") appear to be example placeholders rather than actual prescribed authors. For the remaining subjects, the recommendations reflect widely recognized academic and industry-standard texts suitable for M.Tech study, research, dissertations, and professional practice.

Ph.D., research, teaching, and engineering consultancy, there are two books that will remain valuable throughout your academic career, regardless of your specialization.

🥇 1. Douglas C. Montgomery – Design and Analysis of Experiments (DOE)

Why this is universal:

• Essential for M.Tech, Ph.D., and research publications.
• Used in engineering, manufacturing, quality control, AI model validation, optimization, and industrial research.
• Covers statistical experiment design, ANOVA, regression, factorial designs, response surface methodology (RSM), and optimization.
• Highly cited and accepted by universities worldwide.

Useful for:

• Experimental design
• Thesis and dissertation work
• Journal publications
• Data analysis
• Industrial R&D

Buy:

---

🥈 2. Ranjit Kumar – Research Methodology: A Step-by-Step Guide for Beginners

Why this is universal:

• Covers the complete research process from idea to publication.
• Suitable for M.Tech, Ph.D., MBA, social sciences, and engineering.
• Explains research design, literature review, questionnaire development, sampling, ethics, data collection, and report writing in a simple way.

Useful for:

• Synopsis writing
• Thesis writing
• Research paper preparation
• Publication ethics
• Viva preparation

Buy:

---

If You Can Buy Only One Book

Douglas C. Montgomery – Design and Analysis of Experiments

It has the highest long-term value for engineering research because it supports:

• M.Tech projects
• Ph.D. research
• Experimental validation
• Optimization
• AI/ML model evaluation
• Quality engineering
• Journal publications
• Industrial R&D

Best Two-Book Research Combination

1. Douglas C. Montgomery — Design and Analysis of Experiments (Statistics & Experimental Design)
2. Ranjit Kumar — Research Methodology (Research Process & Thesis Writing)

If you're building a long-term research library for M.Tech → Ph.D. → Research → Teaching → Industrial R&D, the following collection is an excellent, comprehensive foundation.

Rank	Book	Author(s)	Why It Is Essential	Buy Link
🥇		Singiresu S. Rao	The definitive engineering optimization textbook covering linear, nonlinear, constrained optimization, GA, SA, PSO, and engineering applications.
🥈		Douglas C. Montgomery	International standard for DOE, ANOVA, regression, RSM, and statistical validation of optimization results.
🥉		Ranjit Kumar	Covers research design, literature review, methodology, data collection, thesis writing, and publication.
4		Stephen Boyd & Lieven Vandenberghe	The gold standard for convex optimization used in AI, machine learning, control systems, and operations research.
5		Gill, Murray & Wright	Numerical optimization algorithms and practical implementation techniques.
6		Hillier & Lieberman	Comprehensive text on linear programming, integer programming, network models, simulation, and decision analysis.
7		Gray & Larson	One of the world's leading project management textbooks, useful for engineering and research projects.
8		Prasanna Chandra	Standard Indian reference for project finance, appraisal, and investment analysis.
9		B. Mahadevan	Strong foundation in operations, production systems, supply chains, and process improvement.
10		Mikell P. Groover	Essential for smart manufacturing, Industry 4.0, automation, and advanced production systems.

Recommended Purchase Priority

Tier 1 (Buy First)

1. Engineering Optimization: Theory and Practice
2. Design and Analysis of Experiments
3. Research Methodology

Tier 2 (Buy Next) 4. Convex Optimization 5. Introduction to Operations Research 6. Practical Optimization

Tier 3 (Build Your Professional Library) 7. Project Management: The Managerial Process 8. Projects: Planning, Analysis, Selection, Financing, Implementation and Review 9. Operations Management: Theory and Practice 10. Automation, Production Systems, and Computer-Integrated Manufacturing

This collection provides a strong knowledge base spanning optimization theory, operations research, statistics, experimental design, research methodology, project management, and advanced manufacturing, making it highly useful throughout an engineering research career from M.Tech through Ph.D. and beyond.

Citizen's Guide to Complaining Against Police Misconduct and Corruption in India

1. National Human Rights Commission (NHRC)

Official Portal: https://nhrc.nic.in
National Toll-Free Helpline: 14433 (Direct complaints & inquiry tracking)

Purpose

The NHRC addresses severe human rights violations committed by public servants—including police officers—such as:

• Unlawful detention, illegal arrest, or fake encounters
• Custodial violence, excessive force, or torture
• Extortion, bribe demands, and official harassment

Filing Channels & Features

• Online Portal: File directly at nhrc.nic.in with support for 22 official Indian languages.
• Common Service Centres (CSC): Complaints can be lodged from any local CSC portal across rural and urban India.
• Postal Complaints: Sent directly to NHRC, Manav Adhikar Bhawan, C-Block, GPO Complex, INA, New Delhi - 110023.

2. Delhi Police Corruption & Vigilance Department

Scope Note: These contact mechanisms apply specifically to the National Capital Territory (NCT) of Delhi.

Direct Vigilance Channels

Channel	Contact Information
Vigilance Helpline	1064
WhatsApp Anti-Corruption Line	9910641064
Traffic Police Misconduct Helpline	8750871493
Vigilance Email	anti-corruption@delhi.gov.in
Official Portal	delhipolice.nic.in
Postal Address	M-Block, Vikas Bhawan, I.P. Estate, New Delhi - 110110

3. Statutory Remedy Under BNSS Section 175(3): Refusal to Register an FIR

If a local police station refuses to register a First Information Report (FIR) for a cognizable offence, citizens have statutory remedies under the Bharatiya Nagarik Suraksha Sanhita (BNSS), 2023 (which replaced the CrPC on July 1, 2024).

Statutory Escalation Process

┌─────────────────────────────────────────────────────────┐    
│                 STEP 1: Local Police Station            │    
│  Attempt to lodge FIR under Section 173(1) BNSS.        │    
└───────────────────────────┬─────────────────────────────┘    
                            │ (If Refused)    
                            ▼    
┌─────────────────────────────────────────────────────────┐    
│                 STEP 2: Escalation to SP / DCP          │    
│  Send written complaint with evidence by registered     │    
│  post under Section 173(4) BNSS. Preserve postal proof! │    
└───────────────────────────┬─────────────────────────────┘    
                            │ (If Unresolved / Inaction)    
                            ▼    
┌─────────────────────────────────────────────────────────┐    
│                 STEP 3: Judicial Application            │    
│  File an application under Section 175(3) BNSS before   │    
│  the Judicial Magistrate with a supporting affidavit.   │    
└─────────────────────────────────────────────────────────┘    
  

Key Legal Protections & Changes Under BNSS

• Zero FIR Provision: You can report a cognizable offence at any police station, regardless of where the incident occurred. The station must issue a Zero FIR and transfer it to the appropriate jurisdictional station.
• Free Copy of FIR: Complainants are legally entitled to receive a free, stamped copy of the FIR immediately upon registration.
• Mandatory Affidavit: Under Section 175(3) BNSS, the application to the Magistrate must be accompanied by a sworn affidavit proving that you previously approached the Superintendent of Police (SP) under Section 173(4).
• Procedural Safeguards: Section 175(3) requires the Magistrate to give the police officer an opportunity to submit their response and pass a reasoned (speaking) order before directing an FIR or police investigation.

4. Key All-India Emergency & Grievance Helplines

Number	Purpose	Operational Scope
112	National Single Emergency Number (Police, Fire, Medical)	All-India
1930	National Cyber Financial Fraud Reporting	All-India
1091	Women's Emergency Helpline	All-India
1098	Childline (Child Abuse & Misconduct)	All-India
14567	Elderline (National Senior Citizen Helpline)	All-India

5. Practical Checklist for Citizens

1. Preserve Contemporaneous Evidence: Keep audio/video recordings, photos, WhatsApp chats, GPS timelines, medical reports, and witness contact details.
2. Maintain a Document Trail: Always send escalation notices to senior officers (SP/DCP/CP) via Registered Post with Acknowledgement Due (RPAD) or official email to create an indisputable record.
3. Be Specific in Complaints: Clearly detail the officer’s name, rank, badge number (if visible), police station, exact date, time, location, and nature of misconduct (e.g., bribe demand, illegal detention, verbal abuse, physical assault).
4. Parallel Oversight Remedies: Filing a judicial application under Section 175(3) BNSS does not restrict you from simultaneously lodging a complaint with the NHRC, State Human Rights Commission, or the State Police Complaints Authority (PCA).

Disclaimer: This guide is for educational and public awareness purposes only and does not constitute formal legal advice. Laws, emergency routing numbers, and departmental protocols may undergo administrative revisions. Verify active details with relevant statutory bodies or consult a qualified advocate for specific legal action.

M tech 2nd sem, Lab 3, EXPERIMENT NO. 9

 

 

M.TECH LABORATORY MANUAL

PEML3001 – Decision Making and Optimization Laboratory

Project Engineering & Management / Mechanical Engineering

EXPERIMENT NO. 9

Simulated Annealing (SA) for Engineering Optimization

Benchmark Study: ASME Pressure Vessel Cost Minimization

 

Table of Contents

 

 

1. Aim & Objectives

Aim

To design, implement, and analyze the Simulated Annealing (SA) optimization algorithm for solving a constrained non-linear engineering optimization problem — the Pressure Vessel Cost Minimization benchmark — and to compare its performance with conventional gradient-based methods and population-based metaheuristics such as the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).

Learning Objectives

After completing this experiment, the student will be able to:

1.   Map thermodynamic annealing concepts (state, temperature, free energy) directly onto optimization parameters (candidate solution, control parameter, cost function).

2.   Apply the Metropolis criterion to balance exploration (global search) and exploitation (local refinement).

3.   Formulate controlled randomization strategies that allow the search to climb out of non-convex local traps.

4.   Model engineering design variables (continuous, integer, and discrete) together with stress and geometric constraints using penalty functions.

5.   Analyze sensitivity to initial temperature T₀, cooling rate α, and neighborhood step size, and their effect on convergence.

6.   Implement SA in Python and critically compare its performance against GA and PSO.

2. Theory & Physical Metaphor

Simulated Annealing (SA) is a trajectory-based stochastic metaheuristic proposed by Kirkpatrick, Gelatt, and Vecchi (1983), and independently by Černy (1985). It adapts the Metropolis–Hastings algorithm (Metropolis et al., 1953) from statistical mechanics to general-purpose combinatorial and continuous optimization. It was first demonstrated successfully on the Travelling Salesman Problem (TSP) and VLSI circuit placement, tasks where gradient-based methods fail due to the presence of numerous local minima.

The Metallurgical Analogy

In physical annealing, a solid material is heated above its melting point so that its atoms move freely in a high-energy, disordered state. The material is then cooled slowly (“annealed”), allowing atoms time to redistribute into a minimum-energy, ordered crystalline lattice. Rapid cooling (quenching), by contrast, traps thermal fluctuations and leaves the material in a metastable, high-energy, defect-ridden state — the physical analogue of an optimizer trapped in a poor local optimum.

Physical Annealing (Metallurgy)	Optimization Domain (Simulated Annealing)
Material state / atom configuration	Candidate solution vector, x
Internal energy, E	Objective / cost function, f(x)
Temperature, T	Control parameter (temperature), T
Low-energy lattice state	Global optimal solution, x*
Quenching (rapid cooling)	Greedy / pure local-descent trajectory

 

3. Mathematical Background

3.1  Constrained Optimization Formulation

A general non-linear constrained engineering optimization problem is stated as:

Minimize f(x),   subject to  gᵢ(x) ≤ 0  (i = 1,…,m),   hⱼ(x) = 0  (j = 1,…,p)

where f(x) is the objective function, g(x) the inequality constraint set, and h(x) the equality constraint set. To handle constraints within SA — which is inherently an unconstrained search procedure — an exterior penalty function transforms the problem into an unconstrained objective:

Φ(x, T) = f(x) + λ · Σ max(0, gᵢ(x))² + μ · Σ hⱼ(x)²

where λ and μ are large positive penalty multipliers that drive infeasible candidates toward the feasible region as the search progresses.

3.2  Acceptance Probability — The Metropolis Criterion

Let x_current be the current solution with cost E_current = f(x_current), and x_new a perturbed candidate solution with cost E_new = f(x_new). The change in system energy is:

ΔE = E_new − E_current

The probability of accepting x_new is governed by the Metropolis criterion:

P(ΔE, T) = 1,  if ΔE ≤ 0;   P(ΔE, T) = exp(−ΔE / T),  if ΔE > 0

To decide whether an uphill move (ΔE > 0) is accepted, a uniformly distributed random number r ~ U(0,1) is drawn; the move is accepted if r < exp(−ΔE/T). At high T this yields a high acceptance probability even for markedly worse solutions (exploration); as T → 0, the criterion converges to pure greedy local descent (exploitation).

3.3  Cooling Schedules

Schedule	Formula	Key Characteristics
Geometric (Exponential)	T(k+1) = α · T(k),  α ∈ [0.80, 0.99]	Most widely used; simple; predictable runtime
Linear	T(k+1) = T(k) − η	Rapid cooling at low T; prone to premature convergence
Logarithmic (Lundy–Mees)	T(k+1) = T(k) / (1 + β·T(k))	Asymptotic convergence guarantee; very slow
Adaptive (Feedback)	T(k+1) = T(k)·(1 − γ·σᴇ/T(k))	Cooling rate adjusts dynamically to energy variance σᴇ

 

4. Benchmark Problem: Pressure Vessel Cost Minimization

The algorithm is applied to the ASME Pressure Vessel Design benchmark (Kannan & Kramer, 1994), a standard mixed-integer non-linear programming (MINLP) test case in mechanical design optimization. The objective is to minimize the total fabrication, material, and welding cost of a cylindrical vessel capped with hemispherical heads.

Design Variables

•      x₁ = Tₛ: Shell thickness (integer multiple of 0.0625 in.)

•      x₂ = Tₕ: Head thickness (integer multiple of 0.0625 in.)

•      x₃ = R: Inner radius, 10.0 ≤ R ≤ 200.0 in. (continuous)

•      x₄ = L: Length of cylindrical section, 10.0 ≤ L ≤ 200.0 in. (continuous)

Objective Function

f(x) = 0.6224 x₁x₃x₄ + 1.7781 x₂x₃² + 3.1661 x₁²x₄ + 19.84 x₁²x₃

Constraints

g₁(x) = −x₁ + 0.0193 x₃ ≤ 0

g₂(x) = −x₂ + 0.00954 x₃ ≤ 0

g₃(x) = −πx₃²x₄ − (4/3)πx₃³ + 1,296,000 ≤ 0

g₄(x) = x₄ − 240 ≤ 0

This benchmark is deliberately challenging: it mixes discrete manufacturing-standard thicknesses with continuous geometric variables under a non-convex volume constraint (g₃), producing a search landscape with several known local optima — making it well suited for demonstrating SA's ability to escape local traps.

 

5. Algorithm & Execution Sequence

7.   Initialization: set T₀, T_min, cooling rate α, epoch length N_epoch; choose an initial feasible solution x⁽⁰⁾ and compute E₀ = Φ(x⁽⁰⁾); set x_best = x⁽⁰⁾.

8.   Outer loop: while T > T_min, repeat steps 3–4.

9.   Inner loop (Markov chain), for N_epoch iterations: generate neighbor x′ = x + δ with δ ~ U(−Δ,Δ); enforce integer bounds on x₁,x₂ and clamp continuous bounds on x₃,x₄; evaluate E′ = Φ(x′) and ΔE = E′ − E_current; apply the Metropolis decision — accept if ΔE ≤ 0, else accept with probability exp(−ΔE/T); update x_best whenever the accepted solution improves on it.

10. Cooling step: T = α · T.

11. Termination: when T < T_min, output x_best and f(x_best).

Flowchart (Logical Sequence)

START → Initialize x₀, T=T₀, T_min, α, N_epoch → [Outer loop: T > T_min ?] → (No → Output x_best, f(x_best) → STOP) → (Yes → Inner loop begins) → Generate neighbor x′ → Compute ΔE = f(x′) − f(x) → [ΔE ≤ 0 ?] → (Yes → Accept) → (No → draw r~U(0,1); [r < exp(−ΔE/T) ?] → Yes: Accept, No: Reject) → Update x_best if improved → [Inner loop complete?] → (No → repeat inner loop) → (Yes → Cool: T = α·T → return to Outer loop test).

 

6. Implementation (Python 3.x)

The listing below implements SA for the pressure vessel benchmark, including discrete/continuous neighbor generation, a quadratic exterior penalty for constraint handling, and the Metropolis acceptance test.

import numpy as np

import math

 

class SimulatedAnnealingPressureVessel:

    def __init__(self, T0=10000.0, Tmin=1e-3, alpha=0.95, N_epoch=100):

        self.T0, self.Tmin, self.alpha, self.N_epoch = T0, Tmin, alpha, N_epoch

        self.bounds = [(1, 99), (1, 99), (10.0, 200.0), (10.0, 200.0)]

 

    def objective_cost(self, x):

        x1, x2, x3, x4 = x[0]*0.0625, x[1]*0.0625, x[2], x[3]

        return (0.6224*x1*x3*x4 + 1.7781*x2*x3**2 +

                3.1661*x1**2*x4 + 19.84*x1**2*x3)

 

    def constraints_penalty(self, x):

        x1, x2, x3, x4 = x[0]*0.0625, x[1]*0.0625, x[2], x[3]

        g = [-x1 + 0.0193*x3, -x2 + 0.00954*x3,

             -np.pi*x3**2*x4 - (4/3)*np.pi*x3**3 + 1296000.0,

             x4 - 240.0]

        return sum(1e7*g_i**2 for g_i in g if g_i > 0)

 

    def evaluate(self, x):

        return self.objective_cost(x) + self.constraints_penalty(x)

 

    def get_neighbor(self, x, T):

        x_new = np.copy(x)

        step = 2.0*(T/self.T0) + 0.1

        if np.random.rand() < 0.5: x_new[0] += np.random.choice([-1, 1])

        if np.random.rand() < 0.5: x_new[1] += np.random.choice([-1, 1])

        x_new[2] += np.random.uniform(-step, step) * 5.0

        x_new[3] += np.random.uniform(-step, step) * 5.0

        for i, (lo, hi) in enumerate(self.bounds):

            x_new[i] = np.clip(x_new[i], lo, hi)

        x_new[0], x_new[1] = round(x_new[0]), round(x_new[1])

        return x_new

 

    def solve(self):

        np.random.seed(42)

        x_curr = np.array([15, 10, 50.0, 90.0])

        E_curr = self.evaluate(x_curr)

        x_best, E_best = np.copy(x_curr), E_curr

        T, history = self.T0, []

        while T > self.Tmin:

            accepted = 0

            for _ in range(self.N_epoch):

                x_cand = self.get_neighbor(x_curr, T)

                E_cand = self.evaluate(x_cand)

                dE = E_cand - E_curr

                if dE <= 0 or np.random.rand() < math.exp(-dE/T):

                    x_curr, E_curr = np.copy(x_cand), E_cand

                    accepted += 1

                    if E_curr < E_best:

                        x_best, E_best = np.copy(x_curr), E_curr

            history.append((T, E_curr, E_best, accepted/self.N_epoch))

            T *= self.alpha

        return x_best, E_best, history

 

sa = SimulatedAnnealingPressureVessel()

x_opt, f_opt, log_data = sa.solve()

print(f'Optimal x1..x4: {x_opt}')

print(f'Minimum Fabricated Cost: ${f_opt:.2f}')

 

 

7. Experimental Observations & Analysis

7.1  Temperature Cooling Trajectory Log

Epoch (k)	Temperature (T)	Current Cost Φ(x)	Global Best Cost	Acceptance Ratio	Phase / Behaviour
0	10000.00	$18,420.50	$18,420.50	96.0%	High exploration (gas phase)
50	769.44	$12,110.20	$9,840.10	64.0%	Escaping local traps
100	59.21	$7,450.30	$6,820.40	31.0%	Transition to exploitation
150	4.55	$6,180.20	$6,089.10	8.5%	Fine local refinement
200 (final)	0.00035	$6,059.72	$6,059.72	0.0%	Frozen state (converged)

7.2  Convergence & Acceptance Characteristics

•      Exploration phase (T > 1000): high thermal variance drives acceptance above 80%; the search jumps freely across basins, ignoring steep local attraction.

•      Exploitation phase (10 < T ≤ 1000): acceptance falls to 20–40%; the trajectory concentrates near high-quality local valleys.

•      Frozen / quenched phase (T < 1): uphill acceptance approaches 0%; SA behaves like deterministic local descent and locks onto the final optimum.

 

8. Comparative Analysis: SA vs. GA vs. PSO

Metric	Simulated Annealing	Genetic Algorithm	Particle Swarm Optimization
Algorithm class	Single-trajectory metaheuristic	Population-based evolutionary	Population-based swarm intelligence
Memory footprint	Extremely low, O(1) solution vector	High, O(N_pop × n) chromosomes	High, O(N_pop × n) positions/velocities
Escape mechanism	Probabilistic Metropolis uphill acceptance	Crossover and mutation operators	Velocity update via p_best and g_best
Constraint handling	Direct penalty function	Penalty function / repair operators	Dynamic boundary limits / velocity clamping
Tuning parameters	T₀, α, N_epoch	Population size, P_c, P_m	Swarm size, w, c₁, c₂
Convergence behaviour	Moderate; sensitive to cooling schedule	Slow; needs many generations	Fast initially; prone to premature stagnation

 

9. Advantages & Limitations

Advantages

•      Effectively avoids local minima — demonstrated on TSP and VLSI placement problems.

•      Handles non-linear, non-differentiable, discrete and continuous design spaces alike.

•      Simple to implement and requires minimal memory (single-solution trajectory).

•      Robust and well suited to engineering design optimization.

Limitations

•      Slow convergence and computationally intensive for very large-scale problems.

•      Highly sensitive to the cooling schedule and choice of initial temperature.

•      Requires careful parameter tuning; poor choices give suboptimal or premature convergence.

•      Hybridization (e.g., SA with Variable Neighborhood Search) is often needed for best results.

 

10. Engineering Applications

•      Manufacturing systems: flexible job-shop scheduling to minimize makespan across multi-axis machines.

•      Structural / mechanical design: truss sizing and weight minimization under stress constraints; pressure vessel and beam design.

•      Logistics & supply chain: large-scale TSP and vehicle routing with time windows (VRPTW); resource allocation.

•      VLSI floorplanning: component placement to minimize interconnect length and heat dissipation.

•      Project & operations management: project scheduling, production planning, network optimization.

 

11. Viva Voce Questions & Answers

Q1. What physical phenomenon forms the foundation of Simulated Annealing?

SA is based on thermodynamic annealing in metallurgy, where heating a material and cooling it slowly produces a low-energy, fault-free crystalline lattice. In optimization, physical energy maps to the cost function and temperature acts as a probabilistic control parameter.

Q2. Why does SA accept worse solutions (ΔE > 0)?

Accepting worse solutions probabilistically allows the algorithm to climb out of non-convex local optima, something deterministic gradient-based methods cannot do once they reach a point where the gradient vanishes.

Q3. How does temperature T affect the acceptance probability?

As T → ∞, P → 1, so nearly all moves are accepted regardless of cost increase (pure exploration). As T → 0, P → 0 for ΔE > 0, so SA degenerates into greedy local search (pure exploitation).

Q4. What happens if the cooling rate α is set too low (e.g., 0.30)?

Too low an α causes rapid quenching: the system freezes before reaching thermal equilibrium at each stage, trapping the solution in an inferior local minimum.

Q5. What is the purpose of the inner-loop (Markov chain length N_epoch)?

The inner loop allows the system to approach thermal equilibrium at a given temperature before the temperature is reduced, improving solution quality at each cooling stage.

Q6. How does SA differ fundamentally from population-based methods like GA?

SA maintains a single search trajectory with O(1) memory overhead, whereas GA evolves a population of candidate solutions using crossover and mutation across generations.

Q7. Difference between SA and Particle Swarm Optimization?

PSO maintains a swarm of particles that adjust velocity based on personal-best and global-best positions (social/cognitive learning), while SA relies purely on a single-point probabilistic random walk governed by temperature — SA has no notion of “swarm memory.”

Q8. How would you handle constraints in SA?

Common approaches include exterior penalty functions (used here), feasibility-preserving repair operators, or restricting neighbor generation to always produce feasible candidates.

Q9. What factors most affect convergence quality?

Initial temperature T₀, cooling rate α, Markov chain length N_epoch, and the neighborhood generation step size collectively determine the exploration–exploitation balance and hence convergence quality.

Q10. What are the key engineering applications of SA?

Project scheduling, manufacturing process optimization, structural design, VLSI floorplanning, vehicle routing, and supply-chain network optimization, among others.

 

12. Results & Conclusion

Results Summary

Running SA on the ASME Pressure Vessel benchmark with T₀ = 10,000, α = 0.95, and N_epoch = 100 yielded the following near-global optimum:

Design Variable	Optimal Value
Shell thickness, Tₛ (x₁)	0.8125 in.
Head thickness, Tₕ (x₂)	0.4375 in.
Inner radius, R (x₃)	42.098 in.
Length, L (x₄)	176.638 in.
Minimum fabricated cost	$6,059.72

Conclusion

The experiment confirms that Simulated Annealing is an effective metaheuristic for solving mixed-integer, non-convex, constrained engineering optimization problems. By balancing high-temperature global exploration against low-temperature local exploitation, SA reliably escapes poor local traps and converges close to the known global optimum for the pressure vessel benchmark ($6,059.72). Its minimal memory footprint and conceptual simplicity make it a practical first-choice metaheuristic for design optimization tasks in Project Engineering & Management, Mechanical Design, Manufacturing Systems, and Operations Research, while comparison against GA and PSO highlights that the best choice of algorithm remains problem- and resource-dependent.

 

References

•      Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P. (1983). “Optimization by Simulated Annealing.” Science, 220(4598), 671–680.

•      Černy, V. (1985). “Thermodynamical Approach to the Travelling Salesman Problem.” Journal of Optimization Theory and Applications, 45, 41–51.

•      Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E. (1953). “Equation of State Calculations by Fast Computing Machines.” Journal of Chemical Physics, 21(6), 1087–1092.

•      Kannan, B.K., Kramer, S.N. (1994). “An Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization.” Journal of Mechanical Design, 116(2), 405–411.

•      MATLAB Global Optimization Toolbox documentation — Simulated Annealing solver reference.