🧮Operations Research

Abstract

This blog post addresses the design of a sustainable logistic network for GreenForwarder—a multinational freight company—by balancing profitability, environmental emissions, and regional reach. A multi-objective network optimization problem is formulated over a graph that represents cities and potential transport connections. Using a modified Minimum Spanning Tree (MST) algorithm that incorporates capacity constraints and investment costs, the approach has been inspired by the Steiner Tree Problem and evaluates candidate edges dynamically by considering cost, emission factors, and a bonus for expanding regional reach. POC and LIVE differ significantly in their approaches, particularly in their starting points. POC begins by simplifying the “full” graph and focusing on optimizing its objective function, whereas LIVE prioritizes satisfying its unique constraint from the outset. For the MVP, two methods are employed to determine which approach would yield a better outcome, as the significance of profit’s contribution was unknown during the project’s initial stages. Detailed experimental results, analysis, and comparisons are provided in later sections.

Introduction

The idea for this blog originated on an 1 hour long boarding process on my last trip. The process of boarding an airplane appears deceptively simple; yet, it exhibits surprisingly high delays compared to boarding other forms of transportation such as buses or trains. This document aims to provide a mathematically rigorous explanation of why the boarding process is so inefficient. We build a model that captures both stochastic delays (due to bag stowing, seating interference, etc.) and systematic constraints imposed by the boarding procedure.

In this post, I present an in‐depth analysis of a project that investigates optimal location choices for competing firms using concepts from graph theory and game theory. The project models a set of cities as nodes in a graph and employs two primary methods: the iterated elimination of strictly dominated strategies and local search dynamics. I provide a detailed exposition of the mathematical foundations, algorithms, and extensions implemented to reflect more realistic scenarios. This is my answer to a university assignement.