Published: February 2025
Abstract: This report presents a comprehensive study on optimizing sustainable purchasing and procurement by applying multi-objective optimization techniques under circular economy principles. Sustainable procurement aims to achieve triple bottom line outcomes – economic, environmental, and social benefits – but these objectives often conflict. We integrate circular economy principles (waste reduction, resource reuse) with advanced optimization methods to support decision-makers in balancing cost efficiency with environmental stewardship and social responsibility. A mathematical framework is developed, and solution approaches including Linear Programming (LP), Genetic Algorithms (GA), and Particle Swarm Optimization (PSO) are applied to model procurement decisions with multiple objectives. The report provides detailed formulations and pseudocode for each method, and evaluates their performance on case studies in public sector procurement and industry supply chains. Results demonstrate that multi-objective optimization yields a set of Pareto-optimal procurement strategies, enabling significant cost savings alongside reductions in waste and carbon footprint. We discuss the comparative advantages of exact vs. heuristic methods, the challenges in practical implementation, and the role of such optimized procurement in advancing circular economy goals. Finally, policy implications and future research directions are outlined to guide the adoption of sustainable procurement optimization in practice.
In recent years, organizations worldwide have increasingly recognized the need to integrate sustainability into purchasing and procurement decisions. Traditional procurement practices focused primarily on cost and quality; however, modern sustainable procurement expands this focus to include environmental stewardship and social responsibility. This shift is driven by global concerns such as resource depletion, climate change, and social equity, and is encapsulated in the concept of the circular economy. A circular economy is an economic system aimed at eliminating waste and promoting the continual use of resources:contentReference[oaicite:0]{index=0}, in contrast to the linear “take-make-dispose” model of production and consumption. It is based on three core principles – designing out waste and pollution, keeping products and materials in use, and regenerating natural systems:contentReference[oaicite:1]{index=1}. By reusing, refurbishing, and recycling materials, the circular economy seeks to extend product lifecycles and reduce the need for virgin resources.
Sustainable procurement serves as a critical lever for advancing circular economy objectives. By carefully selecting what goods and services to purchase and from whom, governments and companies can influence supply chains to become more sustainable and circular. According to the United Nations Environment Programme, sustainable procurement can accelerate the transition to a circular economy and shift consumption and production patterns towards sustainability:contentReference[oaicite:2]{index=2}. Indeed, many public institutions are beginning to incorporate circular criteria into procurement policies – for example, requiring a percentage of recycled content or end-of-life take-back provisions in contracts. The 2017 Global Review of Sustainable Public Procurement (SPP) highlights that SPP is becoming a widespread practice, with activities on the rise across all types of organizations:contentReference[oaicite:3]{index=3}. This trend reflects a growing acknowledgment that procurement decisions have far-reaching impacts on environmental outcomes (such as waste generation and greenhouse gas emissions) and social outcomes (such as labor practices and community well-being).
However, integrating sustainability into procurement is inherently a multi-objective decision problem. Procurers must balance the economic objective of cost minimization with environmental objectives (e.g. minimizing carbon footprint, reducing waste) and often social objectives (e.g. supporting local businesses or fair labor). The triple bottom line framework introduced by Elkington posits that organizations should give equal weight to social, environmental, and financial performance:contentReference[oaicite:4]{index=4}. In practice, these objectives can conflict: for instance, products with lower environmental impact may come at a higher price, or prioritizing local suppliers (social benefit) might conflict with cost efficiency if local options are more expensive. Traditional single-objective approaches are ill-suited to address these trade-offs. Instead, what is required is an approach that can handle multiple objectives simultaneously, providing decision-makers with a set of optimal trade-off solutions.
Multi-objective optimization techniques offer a means to systematically tackle such trade-offs. Rather than producing a single “optimal” solution, multi-objective optimization yields a set of Pareto optimal solutions, each of which is non-dominated (i.e. no objective can be improved without worsening at least one other objective):contentReference[oaicite:5]{index=5}. This Pareto frontier allows procurement managers to understand the landscape of possible outcomes – for example, how much additional cost would be incurred to achieve a given level of emissions reduction – and then make informed decisions aligned with organizational priorities or policy goals. In the context of sustainable procurement under circular economy principles, multi-objective optimization can help answer questions like: What is the minimum achievable environmental impact for a given budget? Or conversely, what is the minimal cost increase required to significantly improve environmental and social performance?
This research is conducted under the aegis of the London International Studies and Research Center (London INTL), in collaboration with its Research and Development Department, to develop a framework for optimizing procurement practices with environmental, economic, and social considerations. We combine operations research methods and advanced evolutionary algorithms to address the sustainable procurement problem. In particular, we formulate a mathematical model of the procurement decision that captures circular economy considerations (such as reuse and recycling flows) and multiple objectives. We then apply and compare three solution approaches: (1) traditional Linear Programming (LP) techniques (extended to handle multiple objectives via goal programming and weighted-sum methods), (2) a Genetic Algorithm (GA) tailored for multi-objective optimization, and (3) a Particle Swarm Optimization (PSO) approach for multi-objective search. The GA and PSO are metaheuristic techniques inspired by natural processes – GAs mimic biological evolution via selection, crossover, and mutation:contentReference[oaicite:6]{index=6}, while PSO is inspired by the social behavior of flocking birds or schooling fish:contentReference[oaicite:7]{index=7}. These population-based algorithms are well-suited to exploring large, complex solution spaces and approximating Pareto-optimal fronts for multiple objectives.
The remainder of this report is structured as follows. Section 2 reviews the relevant literature and background on sustainable procurement, circular economy principles, and multi-objective optimization applications in supply chain management. Section 3 outlines the methodology, including the conceptual framework and solution techniques, with pseudocode provided for the GA, PSO, and multi-objective LP approaches. Section 4 presents the mathematical models in detail, formulating the procurement optimization problem and describing how the objectives and constraints are modeled. Section 5 describes the implementation of these models and algorithms, including any assumptions, data requirements, and computational tools used. Section 6 provides several case studies – including a public sector procurement scenario and an industrial supply chain scenario – illustrating the application of the proposed approach and discussing results with real-world data. Section 7 compares the results across case studies and discusses key findings, including the performance of different optimization methods. Section 8 discusses the practical challenges of implementing sustainable procurement optimization and how these might be mitigated. Section 9 outlines future research directions and improvements, such as incorporating uncertainty and new technologies like blockchain and AI. Finally, Section 10 concludes the report, highlighting the contributions of this work and the importance of multi-objective optimization in achieving sustainable, circular procurement practices.
Sustainable procurement is broadly defined as the process of acquiring goods and services in a way that achieves value for money on a whole-life basis while benefitting society and the economy, and minimizing damage to the environment. It is an implementation of the concept of sustainability in the procurement function of organizations. Many governments and corporations have developed sustainable procurement policies that embed criteria such as environmental performance, social responsibility, and ethical considerations into procurement decisions. For instance, the World Bank and United Nations agencies now include sustainability criteria in bidding processes for projects, and the European Union has developed Green Public Procurement (GPP) guidelines to help public authorities purchase products with a lower environmental footprint.
The circular economy (CE) concept is central to environmental sustainability in procurement. In a circular economy, value retention and recovery processes like reuse, remanufacturing, and recycling are emphasized so that the end-of-life of one product becomes the feedstock for another, forming a closed-loop system. The Ellen MacArthur Foundation, a leading voice on circular economy, describes it as an economy based on designing out waste and pollution, keeping products and materials in use for as long as possible, and regenerating natural systems:contentReference[oaicite:8]{index=8}. Applying these principles to procurement means that purchasing decisions should favor products that are durable, repairable, recyclable, or made from recycled materials, and suppliers that offer take-back schemes or use renewable inputs. For example, a circular procurement approach in electronics might prioritize laptops that are refurbished or modular (for easy part replacement), and include contract terms for vendor take-back and recycling of old equipment.
By leveraging procurement in this way, organizations can drive circularity in supply chains. A report by the World Economic Forum found that companies implementing sustainable procurement can not only reduce their environmental impact but also realize financial benefits, such as a 5–20% increase in revenue and 9–16% reduction in supply chain costs on average:contentReference[oaicite:9]{index=9}. These figures illustrate the potential win-win of well-designed sustainable procurement strategies: reduced environmental footprint along with cost savings, often through efficiency gains and waste reduction. Additionally, sustainable procurement can enhance brand value and reduce risk:contentReference[oaicite:10]{index=10} by ensuring more resilient supply chains and compliance with emerging regulations (e.g., on carbon emissions or waste).
There is a growing body of case studies demonstrating successful integration of circular economy principles into procurement. For instance, an Italian initiative on circular public procurement in construction found that requiring recycled materials and waste-minimization plans in public works contracts led to significant reductions in landfill waste without increasing costs (One Planet Network, 2020). Similarly, several cities in the Netherlands and Scandinavia have piloted circular procurement for furniture and textiles, achieving high rates of material reuse. These cases underscore that, with the right criteria and supplier engagement, circular procurement can be practical and beneficial. Nonetheless, they also highlight challenges, such as the need for reliable metrics to evaluate circularity and the importance of market availability of sustainable alternatives. This points to the need for decision-support tools (like optimization models) to help procurement officials quantitatively evaluate options under multiple criteria.
The notion of pursuing multiple objectives in supply chain and operations management is not new. The triple bottom line (TBL) – often summarized as “People, Planet, Profit” – provides a foundational perspective that sustainability performance encompasses social (people) and environmental (planet) dimensions in addition to economic (profit). The term was popularized by John Elkington in the late 1990s to encourage businesses to broaden their focus beyond profit alone:contentReference[oaicite:11]{index=11}. In procurement and supply chain contexts, this translates to objectives such as minimizing environmental impact (e.g., carbon emissions, water usage, toxic waste), maximizing social value (e.g., supporting fair trade, local employment, diversity and inclusion in the supplier base), alongside the traditional goal of cost effectiveness or value for money.
Balancing these objectives is inherently a multi-criteria decision-making (MCDM) problem. Early approaches to incorporate multiple criteria in procurement decisions often relied on scoring models or multi-criteria decision analysis techniques like AHP (Analytic Hierarchy Process) or TOPSIS, where decision-makers assign weights to criteria and score alternatives. While useful for supplier selection or simple purchasing choices, these methods do not scale well to complex procurement planning problems with numerous variables (such as determining order quantities across many items and suppliers) or where trade-offs need to be optimized rather than just evaluated. This is where multi-objective optimization methods become valuable – they can handle large combinatorial decision spaces and formally optimize according to mathematical representations of multiple objectives.
In the broader field of supply chain management, researchers have applied multi-objective optimization to problems like network design, production planning, and logistics. For example, closed-loop supply chain design (which incorporates reverse logistics for returns and recycling) inherently involves multiple objectives, as companies seek to minimize cost while also maximizing recovery of end-of-life products and minimizing environmental harm. Studies have developed multi-objective models for closed-loop supply chains, optimizing economic and environmental criteria simultaneously:contentReference[oaicite:12]{index=12}. Some models also include social objectives, reflecting corporate social responsibility goals or regulatory compliance. For instance, Kılınç and Şahin (2022) propose a supply chain network design model that addresses all three sustainability pillars: minimizing economic cost, reducing environmental emissions, and maximizing social benefits (such as job creation):contentReference[oaicite:13]{index=13}.
Academic literature shows that incorporating environmental and social criteria can significantly alter the decisions recommended by optimization models. Yadav et al. (2019) demonstrated that a purely cost-minimizing supply chain design for a manufacturing firm would choose a very different configuration than a design that also minimizes carbon emissions – the latter might favor more regional distribution centers to reduce transport distances, at the expense of some economy of scale. The result is a spectrum of solutions from cost-optimal to emission-optimal, highlighting the value of Pareto optimization in revealing trade-offs. Without a multi-objective approach, a decision-maker might only see one end of this spectrum.
Importantly, multi-objective supply chain models typically yield a set of efficient solutions rather than a single solution. To choose among these, additional decision criteria or stakeholder preferences have to be applied. This is sometimes supported by methods like goal programming (where specific target levels for each objective are set, and the model minimizes deviations from these goals) or interactive optimization (where decision-makers iteratively adjust weights or goals after seeing results). These approaches link the analytical results of optimization with the practical decision-making process in organizations.
Solving multi-objective optimization problems can be challenging, especially when the problem is large-scale (many decision variables and constraints) and when objectives conflict strongly. Two broad categories of techniques are prevalent: exact methods and metaheuristic methods. Exact methods include extensions of mathematical programming (like linear programming, mixed-integer programming) that find provably optimal solutions. Common exact approaches for multi-objective optimization involve converting it into a series of single-objective problems – for example, using the weighted sum method (assigning weights to each objective and summing them into one composite objective) or the epsilon-constraint method (optimizing one objective while converting others into constraints with specified bounds).
Linear Programming (LP) is a classical exact approach for optimization when the problem can be modeled with linear relationships. The simplex algorithm, invented by George Dantzig in 1947, can efficiently find the optimal solution to linear optimization problems:contentReference[oaicite:14]{index=14}. Over decades, LP and its extensions (like Mixed-Integer Linear Programming, MILP, for problems requiring integer decisions) have been widely used in supply chain optimization. For multi-objective LP problems, a common approach is to solve a family of LPs with varying weights on objectives to trace out the Pareto frontier. While exact and reliable, this approach can be computationally expensive if many Pareto-optimal solutions are needed or if the MILP is NP-hard (as is the case for many combinatorial procurement problems). Still, for moderately sized problems, exact multi-objective optimization can provide high-quality solution sets. Additionally, interactive methods allow decision-makers to adjust weights “on the fly” to hone in on a preferred compromise solution.
On the other hand, metaheuristic algorithms have gained popularity for multi-objective optimization in complex or large-scale scenarios. These are approximate methods that search for good solutions without guaranteeing optimality, but they are often able to find near-optimal and diverse solutions within reasonable time frames even for very complex problems. Among the most popular in this domain are evolutionary algorithms like Genetic Algorithms (GAs) and swarm intelligence algorithms like Particle Swarm Optimization (PSO) and Ant Colony Optimization.
Genetic Algorithms (GAs) are inspired by natural evolution. They work by encoding potential solutions to a problem as “individuals” in a population, and then iteratively improving the population through selection (preferentially keeping fitter solutions), crossover (combining parts of two solutions to create new ones), and mutation (randomly tweaking solutions). GAs are particularly well suited to multi-objective problems when implemented as Multi-Objective Evolutionary Algorithms (MOEAs). One landmark algorithm is the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) developed by Deb et al. (2002):contentReference[oaicite:15]{index=15}. NSGA-II introduced an efficient way to rank individuals by dominance (Pareto ranking) and to maintain a diverse spread of solutions along the Pareto front using a crowding distance mechanism. Because of these features, NSGA-II and its variants have been widely applied to engineering and management problems requiring simultaneous optimization of multiple metrics. In the context of sustainable procurement, a GA-based approach can evolve a set of procurement plans (each plan is an individual) toward better cost, environmental, and social outcomes. Prior studies have successfully used GAs for multi-objective supply chain design, showing that they can approximate the Pareto frontier well:contentReference[oaicite:16]{index=16}.
Particle Swarm Optimization (PSO) is another metaheuristic technique introduced by Kennedy and Eberhart in 1995. PSO simulates a swarm of particles (each particle is a candidate solution) moving through the solution space. Each particle adjusts its position based on its own experience and the swarm’s collective experience, converging toward good solutions. PSO has a reputation for simplicity and quick convergence on many problems. For multi-objective optimization, variants like MOPSO maintain an archive of non-dominated solutions and guide the swarm using leaders chosen from this archive. PSO has been applied to problems such as sustainable supplier selection and production planning with multiple objectives, often yielding good results with fewer parameters to tune than GAs. For example, Frontiers research by Kousar et al. (2024) implemented a PSO-based approach to optimize a biomass supply chain considering economic, environmental, and social objectives, demonstrating the technique’s viability in a sustainability context:contentReference[oaicite:17]{index=17}. PSO’s inspiration from social behavior (bird flocking or fish schooling) makes it effective at exploring the trade-offs by information sharing among candidate solutions:contentReference[oaicite:18]{index=18}.
Beyond GAs and PSO, other techniques in literature include Ant Colony Optimization (used for routing-type procurement problems with multiple objectives), Simulated Annealing, and various hybrid approaches that combine exact and heuristic methods (for instance, using an LP solver to fine-tune the solutions found by a GA). Fuzzy optimization and stochastic programming have also been integrated with multi-objective models to handle uncertainty in sustainable procurement (for instance, uncertain demand or price can be included as fuzzy goals or via scenarios). A recent trend is the exploration of machine learning-assisted optimization, where predictive models help guide the search or evaluate the feasibility of solutions, thereby speeding up the optimization process.
Overall, the literature suggests that multi-objective optimization methods are essential for navigating the trade-offs inherent in sustainable procurement and circular economy initiatives. However, there remain research gaps, such as how to effectively incorporate qualitative social criteria into quantitative models, how to ensure decision-maker preferences are appropriately reflected, and how to scale these methods for enterprise-level procurement with thousands of items and suppliers. A review by Jayarathna et al. (2021) of 95 scholarly articles on sustainable supply chain optimization noted the need for better decision-support tools and highlighted the challenge of selecting suitable multi-objective optimization techniques for different problem contexts:contentReference[oaicite:19]{index=19}. Our research builds on this foundation by providing a concrete modeling framework and comparing multiple solution approaches on practical case studies, thereby contributing to both the theoretical and applied aspects of sustainable procurement optimization.
The methodology of this research integrates conceptual modeling of sustainable procurement with the application of multi-objective optimization techniques. Figure 1 provides an overview of the framework employed. At a high level, the process involves: (i) defining the procurement scenario and sustainability objectives, (ii) formulating a mathematical model (including objective functions and constraints) that captures the essence of the scenario under circular economy principles, (iii) selecting appropriate optimization techniques to solve the model, and (iv) analyzing the resulting Pareto-optimal solutions to derive insights and recommendations.
[Conceptual diagram of methodology: define problem → formulate model → apply optimization (LP/GA/PSO) → obtain Pareto solutions → decision analysis]
Problem Definition: The first step is to clearly define the procurement context, including the items or categories of products/services to be procured, the potential suppliers or supply options, and the criteria of interest. In a sustainable procurement setting, criteria typically include cost, environmental impact, and possibly social metrics. We collaborate with domain experts from the London INTL Research and Development Department to identify relevant metrics: for example, total purchasing cost (economic), carbon footprint or waste generation (environmental), and number of local jobs supported or a supplier sustainability score (social). These become the objectives or constraints in the model. Additionally, any business rules or requirements are noted, such as demand that must be met for each item, budget limits, supplier capacity limits, or regulatory requirements (like minimum percentage of recycled content).
Model Formulation: Using the above problem definition, a mathematical model is constructed. This typically involves defining decision variables that represent the procurement decisions (e.g., how much to purchase from each supplier, or which suppliers to select), objective functions corresponding to each sustainability criterion, and constraints representing the various requirements (demand fulfillment, capacity, etc.). The model formulation process is described in detail in Section 4. During formulation, circular economy principles are embedded where possible – for instance, including variables for quantities of reused or recycled materials, or constraints that ensure waste is minimized or kept within circular loops. The outcome of this step is a multi-objective optimization model, often a linear or integer programming model with multiple objective functions.
Solution Approach Selection: Given the model, we choose solution techniques to find the Pareto-optimal solutions. As indicated, we employ three approaches for comparison:
To facilitate clarity and reproducibility, we provide high-level pseudocode for the GA and PSO procedures in Algorithms 1 and 2 respectively. These algorithms are customized for the sustainable procurement problem but can be generally understood as multi-objective GA/PSO frameworks:
// Algorithm 1: Multi-Objective Genetic Algorithm (GA) for Sustainable Procurement
Initialize population P with N random feasible procurement plans
Evaluate objectives (cost, environmental, social) for each individual in P
Compute Pareto ranks of individuals in P
for gen = 1 to MaxGenerations do:
// Selection (using tournament selection based on Pareto rank and crowding distance)
Select parent pool from P (favoring non-dominated solutions)
// Crossover and Mutation
Initialize offspring population O = {}
while |O| < N:
Select two parents p1, p2 from parent pool
if rand() < CrossoverRate then:
offspring1, offspring2 = Crossover(p1, p2)
else:
offspring1 = p1 (clone); offspring2 = p2 (clone)
end if
Mutate offspring1 with probability MutationRate
Mutate offspring2 with probability MutationRate
RepairOffspringToFeasibility(offspring1)
RepairOffspringToFeasibility(offspring2)
Add offspring1, offspring2 to O
end while
Evaluate objectives for all offspring in O
// Combine and select next generation
P' = P ∪ O // combined population
Determine Pareto non-dominated set and ranks in P'
Sort P' by rank (and crowding distance within rank)
P = first N individuals of P' // elitism: keep best N solutions end for // Result: Pareto-optimal set approximated by non-dominated individuals in P
// Algorithm 2: Multi-Objective Particle Swarm Optimization (PSO) for Sustainable Procurement
Initialize a swarm of M particles with random feasible positions X[i] and velocities V[i]
Initialize personal best positions P_best[i] = X[i] for each particle
Initialize an external archive A = {} to store non-dominated solutions
Evaluate objectives for all particles and populate initial archive A with non-dominated particles
for iter = 1 to MaxIterations do:
for each particle i = 1 to M:
// Select a leader from archive (e.g., using roulette wheel on crowding distance)
leader = SelectLeader(A)
// Update velocity and position for each decision variable j:
V[i][j] = w*V[i][j]
+ c1 * r1 * (P_best[i][j] - X[i][j])
+ c2 * r2 * (leader[j] - X[i][j])
X[i][j] = X[i][j] + V[i][j]
end for
RepairToFeasible(X[i]) // ensure particle's position meets constraints
Evaluate objectives for particle i at X[i]
// Update personal best if X[i] is Pareto-dominant over P_best[i] then
P_best[i] = X[i]
end if end for // Update archive with current particle positions
UpdateArchive(A, {X[1], X[2], ..., X[M]}) // add non-dominated solutions, remove dominated, maintain size limit // (Optional) Check for convergence or stagnation and break if achieved end for // Result: Archive A contains the approximated Pareto-optimal set of solutions
Both Algorithm 1 and Algorithm 2 produce an approximation of the Pareto-optimal set for the sustainable procurement problem. These solutions can then be visualized and analyzed. For example, we might graph cost vs. environmental impact to see the trade-off curve (Pareto frontier), or tabulate a few representative solutions (e.g., the extreme cost-minimizing solution, the extreme emission-minimizing solution, and one balanced solution). In addition to the GA and PSO, we also apply the exact multi-objective LP approach for comparison:
// Algorithm 3: Weighted Sum Multi-Objective Linear Programming (Exact method)
Define a set of weight vectors W = { (w1, w2, w3) } covering different preference scenarios
Initialize solution set S = {}
for each weight vector (w1, w2, w3) in W:
Solve the linear programming model:
Minimize w1*Cost + w2*EnvironmentalImpact + w3*SocialPenalty
subject to all procurement constraints
Obtain optimal solution X* and objective values (Cost*, EnvImpact*, Social*)
Add X* (and its objective values) to S
end for
Filter S to retain only non-dominated solutions (Pareto-optimal set)
In the above Algorithm 3, “SocialPenalty” refers to a term we use for social objective if it is formulated as a maximization (we convert it to a minimization by taking a negative or a "penalty" that decreases as social benefit increases). By varying the weights (w1, w2, w3), we sweep across different trade-off preferences – for instance, one extreme weight set might heavily weight cost and ignore environmental impact (yielding the cost-minimum solution), while another does the opposite. We generate a dense set of weights (e.g., in increments of 0.1 or using random weight combinations) to approximate the Pareto front. While this method can find points on the frontier, it can miss non-convex portions of the Pareto front (the weighted sum method only finds Pareto-optimal points on the convex hull of the objective space). The epsilon-constraint method can complement this by capturing non-convex regions: for example, by fixing the environmental impact at various levels and minimizing cost, one can find solutions along concave sections of the trade-off curve. In practice, a combination of weighted sum and epsilon-constraint runs were used to ensure a thorough mapping of the Pareto front for the exact approach.
Analysis of Solutions: After obtaining solution sets from GA, PSO, and LP approaches, we perform analysis to compare their performance and to interpret the solutions. We compute performance metrics such as the diversity of solutions (how well-spread are the Pareto solutions in objective space) and convergence (how close are they to the true Pareto front, where the LP solutions serve as a benchmark of optimality for smaller instances). We also verify if the solutions meet all constraints and whether any need post-processing (for example, if a GA/PSO solution is slightly infeasible due to numerical precision, we adjust it). The best practices from each approach are noted – for instance, GA might find extreme solutions more easily, while PSO might converge faster to a central trade-off solution. These observations inform our recommendations for what method to use in different practical scenarios (discussed in Section 7).
The methodology is thus a blend of model-based and algorithmic components, ensuring that we rigorously define the problem and then leverage computational methods to solve it. By applying three distinct approaches (exact and two heuristics), we aim to triangulate the true Pareto-optimal set and evaluate the practicality of each method in terms of computational effort and quality of solutions. This comprehensive methodology allows us to draw robust conclusions about how sustainable procurement can be optimized under circular economy principles, which we will explore in the subsequent sections.
In this section, we present the mathematical model for the sustainable procurement problem under study, along with the specific formulations used for each objective. We also describe how circular economy considerations are integrated into the model. The model is formulated as a multi-objective optimization problem. For clarity, we first define the notation and then write out the objective functions and constraints.
Indices and Sets:
Decision Variables:
Parameters:
Objective Functions: We consider three objectives corresponding to the triple bottom line:
Z1 = Σi∈I Σj∈J Cij · xij (1)
This objective Z1 (in monetary units) captures the total purchasing expenditure across all items and suppliers.Z2 = Σi∈I Σj∈J Eij · xij (2)
Here Z2 could be measured in aggregate emissions (e.g., CO2 kg) or an environmental impact score. By minimizing Z2, the model favors sourcing options with lower per-unit environmental impacts (for instance, closer suppliers to reduce transport emissions, or suppliers using cleaner production processes).Z3 = Σi∈I Si · &left( Σj∈J xij &right) (3)
Z3 aggregates the social impact of allocating orders to suppliers. Si might be higher for suppliers that are local, small businesses, or have strong corporate social responsibility practices. The inner sum Σjxij represents total business given to supplier i. We want to maximize Z3. In a minimization framework, we will instead minimize -Z3 or treat it separately. But conceptually, maximizing Z3 means choosing suppliers that offer greater social value.Constraints: The model includes several sets of constraints to reflect procurement requirements and circular economy considerations:
Σi∈I xij = Dj, ∀ j ∈ J. (4)
Σj∈J xij ≤ Ui, ∀ i ∈ I. (5)
This ensures we do not allocate orders beyond what a supplier can deliver.Σi,j Cij xij ≤ B. (6)
This constraint might be used in public procurement scenarios with fixed budgets. In multi-objective context, sometimes budget is not a hard constraint but cost is an objective, so we may or may not include this. We keep it optional.xij ≤ Mij · yi, ∀ i, j. (7)
where Mij is a large number (e.g., Mij = Dj) that effectively ties x to y (if yi = 0, then all xij must be 0; if yi = 1, xij can be positive up to demand). And potentially:Σi∈I yi ≤ K, (8)
to limit to K suppliers chosen. For our analysis, we assume no explicit limit on number of suppliers unless scenario demands, focusing on quantity allocation.xij ≥ 0, ∀ i,j. (9)
If integer, xij ∈ ℕ. And yi ∈ {0,1} if those are used. For our main analysis, x is continuous (assuming we can purchase fractional units or large quantities where integrality is not critical).The above constitutes a multi-objective linear programming (MOLP) model. We have three objectives (1), (2), (3) and constraints (4)–(9). In practice, solving a MOLP means finding solutions that balance these objectives. Because all three objectives cannot be optimized simultaneously (except in trivial cases where objectives are not in conflict), the notion of optimality is replaced by Pareto optimality. A solution (a set of xij) is Pareto-optimal if no other feasible solution is better in one objective without being worse in at least one other objective.
To obtain Pareto-optimal solutions, one can either use the aforementioned multi-objective methods or scalarize the problem. One scalarization is to introduce a composite objective:
Z = w1 Z1 + w2 Z2 + w3 ( - Z3 ), (10)
where we minimize Z. Here, -Z3 is used because we want to maximize Z3; minimizing -Z3 is equivalent. w1, w2, w3 are weights summing to 1 (for example) reflecting the decision-maker's relative emphasis on each objective. By choosing different sets of weights, we can generate different solutions. If we do not know the preferences a priori, we generate a broad set of solutions by varying weights. This weighted sum approach was coded as Algorithm 3 in the methodology. In experiments on smaller instances of our procurement model, we used increment steps of 0.1 for weights from 0 to 1 (with w1 + w2 + w3 = 1) to get combinations like (0.8,0.1,0.1), (0.1,0.8,0.1), (0.33,0.33,0.34), etc., each yielding a solution if the problem is solvable.Another approach to solve this model is the epsilon-constraint method: for example, minimize Z1 (cost) subject to Z2 ≤ ε2 and Z3 ≥ ε3. By scanning ε2 and ε3 (environmental and social thresholds), we can find the extreme solutions and points in between. We implemented a variant of this by picking a range for environmental impact and solving a series of MILPs where we constrain emissions to progressively lower values until infeasibility. Each successful run gives a cost-minimized plan for that emission level.
Circular Economy Elements in the Model: The above model, in its base form, indirectly supports circular economy outcomes by the way objectives and parameters are set. For instance, a supplier with a high fraction of recycled material or a take-back program might have a lower Eij (environmental impact per unit) or a higher Si (social benefit score if supporting local recycling jobs). Thus, the optimization would naturally favor such a supplier when minimizing environmental impact or maximizing social benefit. If more explicit circular constraints are desired (e.g., at least X% of procurement from circular sources), those can be added. We included an example parameter Rj earlier; a constraint could be:
Σi∈Ic xij ≥ Rj Dj, ∀ j, (11)
where Ic is the subset of suppliers classified as "circular" suppliers (e.g., offering recycled or refurbished products). This ensures at least Rj fraction of item j comes from circular sources. We will use such constraints in the case study if applicable (for example, requiring a minimum recycled content percentage).The model can grow in complexity depending on how deeply we integrate circular economy flows (like adding variables for returned product flows, inventory for reused items, etc.). For the scope of this report, we keep the model focused on the procurement decision itself and treat circular performance largely through objective coefficients and simple constraints. This is a reasonable approach when one is optimizing procurement choices given a market environment – the model "scores" each supplier option on cost, env, social, and then chooses the mix that best meets goals.
Having formulated the model, the next step is implementing and solving it using the approaches outlined (LP, GA, PSO). In the following section, we discuss how the model was implemented in practice for our experimentation and the details of the scenarios and data used.
We implemented the above models and algorithms using a combination of mathematical programming tools and custom-coded algorithms. This section describes the implementation details, including data preparation, software used, and how the algorithms were run. We also outline a sample scenario and input data to illustrate the process.
For the exact multi-objective LP approach (Algorithm 3), we used a Python-based optimization modeling library (PuLP
for simpler models and Pyomo
for more complex models) interfaced with an LP/MILP solver. In our setup, we primarily employed CBC (the COIN-OR Branch and Cut solver) for linear programming solutions, as it is open-source, and Gurobi for testing on smaller instances due to its faster performance on MILPs (since our model can become an MILP if we include binary supplier selection variables). The weighted sum and epsilon-constraint methods were implemented by iterating over parameters and solving the LP repeatedly. The structure was as follows: define the base model in Pyomo, then in a loop adjust the objective weights or add constraints, resolve the model, and store results. We automated the generation of Pareto solutions this way.
The genetic algorithm and particle swarm optimization were implemented in Python from scratch to allow customization to our procurement problem. We used the random
library for random number generation and some NumPy for vectorized operations to update particles in PSO. Key steps like Pareto ranking for the GA were implemented via sorting and comparisons; since our population sizes were moderate (on the order of 100), this was computationally manageable. To verify our GA/PSO implementations, we tested them on known benchmark problems (like a simple bi-objective knapsack problem) to ensure they were correctly identifying Pareto fronts.
During development, we included checks to enforce feasibility of solutions (the Repair functions in pseudocode). For example, after crossover or mutation in GA, a repair routine would adjust the xij values: if demand was over-satisfied, it would scale down some quantities; if a capacity was violated, it would cut down random selections from that supplier. These heuristics ensured that every individual represented a valid procurement plan. In PSO, after each position update, similar checks were done. If a particle’s position had negative values for some xij, we set those to zero (PSO can sometimes overshoot, making some coordinates negative, which in this context has no meaning). If demand was not exactly met due to a continuous particle position not summing exactly to Dj, we normalized the distribution for that product across suppliers to meet demand exactly (this allowed us to restrict the search to the feasible subspace defined by the linear constraints).
The computational experiments were run on a standard desktop PC (Intel i7 CPU, 16GB RAM). Each run of the GA or PSO for a given scenario (with population size ~100 and 200 generations for GA, or 50 particles and 300 iterations for PSO, as an example) took on the order of a few seconds to a couple of minutes, which is quite reasonable. The LP approach, if solving many weight combinations or a MILP, could take longer – possibly minutes for each solve if the MILP was hard. However, by limiting the number of weight scenarios or focusing on the most relevant ones, we managed that process. For example, we would solve, say, 21 weight combinations (like w1 from 0 to 1 in steps of 0.05 while w2 and w3 share the remainder equally, to bias between cost and combined sustainability) and then use binary search on intervals where we suspected non-convexity.
To ground the discussion, we present a simplified sample scenario with hypothetical data, representative of a small procurement problem. This scenario will also be used later to illustrate results. Suppose a company needs to procure a single type of product (J = 1 for simplicity in this example, we will expand to multiple products in the case studies) and has 3 possible suppliers (I = 3) to choose from. The demand for the product is 100 units. Table 1 provides the data for unit cost, unit environmental impact, and the social score of each supplier. We assume each supplier can supply the full demand (capacity ≥ 100 for each) for this scenario.
Supplier | Unit Cost (USD) | Unit Emissions (kg CO2) | Social Score | Notes |
---|---|---|---|---|
Supplier A | $10 | 5 | 8 | Local supplier with moderate costs, moderate emissions. |
Supplier B | $9 | 8 | 5 | Overseas supplier with low cost but high transport emissions. |
Supplier C | $12 | 3 | 9 | Supplier using recycled materials (low emissions) but higher cost. |
In this table, Supplier B is the cheapest per unit but has the worst environmental performance (8 kg CO2 per unit) and a lower social score (perhaps reflecting that it’s an international supplier with less local community benefit). Supplier C has the lowest emissions due to recycled materials, and the highest social score (perhaps a local recycling enterprise), but its cost is highest at $12/unit. Supplier A is intermediate on all counts.
Our multi-objective problem for this scenario is to decide how many units (out of 100) to buy from each supplier A, B, C to minimize cost, minimize emissions, and maximize social score simultaneously. If we treat it as a continuous allocation, this is analogous to a fractional allocation problem (in reality, one might choose one or two suppliers and give them orders, but let's see what the model suggests in fractional terms first). Using the weighted sum method, we can explore different weightings:
For the full implementation and case studies, we consider multi-product scenarios and more realistic data, but the principles remain the same. The algorithms (GA, PSO) handle larger solution vectors in those cases (one xij for each supplier-item combination). We ensure the random initial solutions of GA/PSO respect demand constraints by distributing each product’s demand randomly among suppliers (one easy way was to generate random fractions for each supplier and normalize them by the sum for each product times demand).
In summary, the implementation stage took the theoretical model and put it into practice using computational tools. The correctness of the implementation was verified on small test cases (like the above) by comparing GA/PSO results with an exhaustive search or LP solution for that case. We then proceeded to apply the implementation to more complex case studies, the results of which are presented in the next section.
To demonstrate the applicability of our multi-objective optimization approach to sustainable procurement, we present several case studies drawn from different contexts: one from the public sector and two from industry. Each case study illustrates how the model can be adapted to a specific scenario, and provides insights gleaned from the optimization results. We also include relevant data and outcomes (tables and figures) to compare scenarios.
Background: Our first case study involves a municipal government (here anonymized as City X) aiming to implement circular economy principles in its procurement of office furniture. The city plans to purchase a batch of office desks and chairs for its new administrative building. The procurement officers want to minimize cost because of budgetary pressure, but they also have strong environmental targets (to reduce waste and embodied carbon) and social goals (to support local employment and businesses). The city partnered with London INTL to optimize this procurement.
Scenario Details: In this scenario, the city can source furniture from three options: (1) a traditional furniture manufacturer (cheapest, but all new materials), (2) a supplier offering refurbished/remanufactured furniture (moderate cost, very low environmental impact since it’s refurbished, and local small business), and (3) a hybrid option where new furniture is made with a high recycled content by a mid-cost manufacturer. We model desks and chairs as two product categories (j=1 desks, j=2 chairs) with demands of say 200 desks and 200 chairs. Table 2 summarizes the input data for cost and environmental footprint per unit for desks from each supplier, and similarly for chairs. Social score is given based on local business and labor practices.
Supplier | Cost/Desk | Cost/Chair | Emissions/Desk (kg CO2) | Emissions/Chair (kg CO2) | Social Score | Remarks |
---|---|---|---|---|---|---|
Traditional Mfg | $150 | $75 | 100 | 50 | 5 | Large company, standard new furniture. |
Refurbished (Local SME) | $120 | $60 | 20 | 10 | 9 | Uses secondhand frames, local labor-intensive. |
Recycled-content Mfg | $180 | $90 | 60 | 30 | 7 | Mid-size company using recycled steel/wood. |
In Table 2, the “Traditional Manufacturer” is cheapest ($150 per desk, $75 per chair) but has the highest emissions (100 kg CO2 per desk, etc.) and a low social score (5) since it's not local. The “Refurbished” supplier has significantly lower emissions (only 20 kg per desk) and a high social score (9) because it’s a local small enterprise employing local workers to refurbish old furniture. Its cost is also lower than the traditional new furniture (likely due to lower material costs, although labor is high but offset by saved materials). The “Recycled-content Manufacturer” has the highest cost and moderate emissions, and a social score in between (7).
Modeling and Constraints: The city requires that at least 50% of the furniture (by quantity) is either refurbished or made of recycled content (to meet a circularity goal). This can be implemented with a constraint: Σi∈{Refurb,Recycled} xi,j ≥ 0.5 Dj for j = desks, chairs. This ensures at least half of desks and chairs come from non-traditional sources. Additionally, the city has a budget cap of $50,000 for this procurement (just an example). We apply that as an overall cost constraint. We then run the optimization using our multi-objective approach with objectives to minimize cost, emissions, and maximize social score.
Results: The multi-objective optimization provides a range of solutions. Some key Pareto-optimal solutions identified are:
These solutions show clear trade-offs. Figure 2 illustrates two dimensions of this trade-off – cost vs. emissions – for the Pareto solutions, with bubble size representing social score (larger bubble = higher social benefit). We see a convex Pareto frontier: moving from Solution A to C, cost increases and emissions decrease. The social score tends to increase as we move towards more sustainable options (because the local refurbished supplier is heavily utilized in low-emission solutions).
[Cost vs Emissions plot: Pareto solutions marked A, B, C. Solution A: high emissions, low cost; Solution C: low emissions, slightly higher cost. Social score indicated by bubble size.]
City X's decision-makers can use this information to choose a strategy. If budget is the overriding concern, Solution A might be chosen, which meets the minimum circular criteria and saves money. If emissions reduction is a high priority and a small budget increase is acceptable, Solution B or C would be preferable. Notably, the model quantified the emission reduction: going from A to C cuts emissions by ~47% (15,000 to 8,000 kg) for roughly a 13% increase in cost ($45k to ~$51k). Depending on the internal carbon pricing or the value the city places on emissions, they can evaluate if that trade-off is worth it. Also, Solution C boosts local economic impact by maximizing orders to the local SME.
Discussion: This case demonstrates how multi-objective optimization can facilitate circular public procurement. The mandatory constraint of 50% circular procurement was easily handled by the model, and the solver then explored beyond that threshold as it tried to improve environmental outcomes. The GA and PSO were particularly helpful in mapping a broad set of feasible mixes under the budget constraint, while the LP weighted-sum approach was used to verify a couple of points (like minimum cost and minimum emission extremes). Importantly, all solutions on the Pareto frontier represent viable procurement plans that meet policy constraints, giving the procurement team a menu of choices with quantified outcomes.
Background: The second case study is drawn from an industrial context, specifically inspired by an apparel e-commerce company similar to the one studied by Dutta et al. (2024):contentReference[oaicite:20]{index=20}. The company operates in a circular business model where returned items (due to customer returns or unsold stock) are either recycled or resold. The challenge is to design a reverse logistics network – deciding how to route returned products to either recycling centers or back to inventory for resale – in a way that balances economic and environmental objectives. While this extends beyond pure procurement into supply chain design, we adapted our model to handle the procurement of logistics services and recycling services, which is analogous to procuring from different suppliers (each potential return processing center is like a supplier option for returned goods).
Scenario Details: The e-commerce company has product returns from three regions that need to be processed. They have options to send these returns to:
Data: For each region's returns (north, south, east; each has say 1000 returned items), we have transportation cost and emission estimates to each of the three options (warehouse, recycler, donation center). Additionally, processing cost at each option (e.g., warehouse handling cost per item vs recycler fee per item) and processing emissions (e.g., energy use in recycling vs minimal in just restocking). The donation outlet will take at most 200 items total (capacity constraint) because demand for donated clothes is limited. Table 3 shows a simplified data set for one region (numbers illustrative):
Return Handling Option | Cost per item | Emissions per item (kg CO2) | Capacity (items) | Notes |
---|---|---|---|---|
Restock via Warehouse | $2.00 | 0.5 | ∞ | Incl. transport to warehouse and inspection. |
Recycle via Recycler Co. | $1.50 | 1.0 | ∞ | Bulk transport to recycler, recycling process emissions. |
Donate via Charity | $1.00 | 0.2 | 200 | Charity pickup, limited capacity. |
Table 3 indicates that donation is cheapest and very low emissions (because items are just picked up and reused), but only up to 200 items can go that route. Recycling is slightly cheaper than restocking ($1.50 vs $2.00) in cost but double the emissions per item (maybe due to energy used to shred and recycle fibers), whereas restocking has moderate emissions mainly from transport and some re-packaging. Notably, this company might prioritize donation first (for social good and PR), then consider cost vs emissions trade-off between recycling vs restocking. The situation is multi-objective: they want to minimize handling costs but also minimize emissions in their reverse logistics as part of their sustainability pledge (some big retailers are aiming for net-zero logistics).
Optimization and Constraints: We set up the model with variables xoption,region = number of items from that region sent to that option. Demand per region is fixed (e.g., 1000 returns each). We have constraints like sum of x across options = total returns per region (all returns must go somewhere), and donation capacity ≤200. We optimize cost and emissions objectives. The donation outlet is given a social benefit score if we were including social objectives, but here we'll simply ensure it's fully used (the model naturally does that because donation is cheapest and lowest emission, it will fill the 200 capacity unless we artificially raise cost or something; indeed, in many runs donation gets maxed out in Pareto solutions).
Results: The optimization yields how many items to send to each route. Key findings:
Figure 3 shows the Pareto curve of total cost vs total emissions for this scenario. As expected, it is concave (diminishing returns): the first ~1400 kg of emissions cuts (from 2840 down to ~1440) can be achieved by switching from all recycle to all restock for non-donated returns, but at a steep cost increase (from $4400 to $5800). There are intermediate points where, say, 50% of returns go to restock and 50% to recycle (beyond donation), giving emissions around ~2140 kg at cost ~$5100 (approximately the solution mentioned).
[Graph: Pareto frontier for Case 2. X-axis: Emissions (kg), Y-axis: Cost ($). Two end points labeled: 'Min Cost' (~$4400, 2840 kg) and 'Min Emissions' (~$5800, 1440 kg).]
Discussion: This case highlights how our model and optimization approach can be applied beyond straightforward procurement of products, to logistics and operations decisions that mimic procurement choices. By treating each routing option as a 'supplier' of the service of handling returns, the same mathematics apply. The results quantify, for the e-commerce company, the cost of making their reverse logistics more sustainable (in terms of emissions). Here, halving the emissions (from 2840 to ~1440 kg) required about $1400 extra cost (around 30% cost increase). The company can use this information to decide if the emissions reduction is worth the cost or if there are perhaps other ways to offset that carbon. Alternatively, if they have a carbon price internally (say $50 per ton of CO2), the 1400 kg reduction is worth $70, which is far below the $1400 cost – implying purely economically it's not justified at that carbon price; they'd need either a higher carbon price or they might choose a middle ground solution. The model also reaffirmed that donation (when possible) is a win-win-win (lowest cost, lowest emissions, high social value), hence they should maximize that, which they did in all Pareto solutions.
Background: Our final case study is inspired by the automotive industry, where manufacturers are increasingly seeking to reduce the environmental impact of their vehicles by using sustainable materials. This often involves a trade-off between material cost, weight (which affects fuel efficiency and thus emissions), and other factors. A study by Hashemi Sohi et al. (2022) considered multi-objective optimization for selecting sustainable materials in a product with multiple components:contentReference[oaicite:21]{index=21}. Here we adapt a simplified version to demonstrate our approach in a materials procurement context.
Scenario Details: Consider an automotive company designing a car and selecting materials for two key components: the chassis and the interior panels. For each component, there are material options:
Data: Table 4 provides data on unit cost and unit weight for each material option per component. We assume the car needs 1 unit of chassis material (the frame) and 1 unit of interior panel set, so essentially it's a selection problem (pick one material for each component).
Component | Material Option | Cost per unit | Weight per unit (kg) | Remarks |
---|---|---|---|---|
Chassis | Steel | $800 | 300 | Conventional high-strength steel. |
Aluminum Alloy | $1200 | 200 | Lighter but pricier. | |
Composite | $1000 | 180 | Carbon fiber composite with recycled fibers. | |
Interior Panels | Plastic | $200 | 50 | Standard ABS plastic. |
Bioplastic | $300 | 45 | Plant-based polymer, slightly lighter. |
From Table 4: For the chassis, Steel is cheapest ($800) but heaviest (300 kg), Aluminum is light (200 kg) but expensive ($1200), Composite is intermediate cost ($1000) and the lightest (180 kg, even lighter than aluminum in this hypothetical). For interior, Plastic is cheaper ($200 vs $300) but a bit heavier (50 vs 45 kg) than Bioplastic.
Optimization: This is a small discrete decision problem. We could solve it by brute force (just 3x2=6 combinations) but using our model: We define binary decision variables for each material option selection. Constraints ensure exactly one material is chosen for each component. We then have objectives to minimize cost = (cost_chassis + cost_panels) and weight = (weight_chassis + weight_panels). We solve it as a multi-objective problem (or just evaluate all combos to get the Pareto set since it’s small).
Results: Listing all combinations and their (Cost, Weight):
Plotting these (Cost vs Weight) would show Steel options on one end and Composite on the other, with no need for aluminum in presence of composite being superior in this dataset (which is interesting, composite beat aluminum both in cost and weight in our numbers except composite was also cheaper here, which might not be realistic usually composite is more expensive but lighter than aluminum; our hypothetical gave composite an edge in both). If we had given composite cost $1300 equal to bioplastic's extra cost, maybe aluminum or something would appear as intermediate, but as is, composite dominates aluminum materials.
Insights: The key trade-off here is cost vs weight. The solution with composite materials is significantly lighter (225 kg vs 350 kg baseline), reducing weight by ~36%, but costs $300 more (30% increase in material cost). If the automaker values weight at, say, $2 per kg saved (just an example via fuel economy benefit), then saving 125 kg might be worth $250 to them, which is slightly less than the $300 extra cost, so maybe not directly justified unless weight has other benefits (performance, compliance with emissions standards, etc.). The multi-objective analysis provides the frontier of choices. If regulatory pressure or consumer demand forces weight reduction (to improve fuel efficiency or EV range), the company might accept higher cost. If they are cost-sensitive, they stick to steel. Notably, the combination Steel + Bioplastic (1100,345) offers a very small weight improvement (5 kg, ~1.4%) for a moderate cost increase (10%), which likely would be an unfavorable trade in practice, but it exists as a Pareto option mathematically for someone who might value any weight saving.
This case is a bit different from the others because it's a discrete choice with few alternatives, but it demonstrates our approach’s flexibility. Also, it aligns with the findings of similar studies that show even moderate shifts to sustainable materials can achieve significant environmental benefits (weight or embodied carbon reduction) at some cost premium:contentReference[oaicite:23]{index=23}. The use of optimization here ensures that the best combinations are considered, rather than ad-hoc selection of a single “green” material that might not yield the best overall balance.
The case studies above provided concrete applications of the multi-objective optimization framework, each highlighting different aspects of sustainable procurement under circular economy principles. In this section, we synthesize the results across case studies and discuss key observations, including the performance of the optimization methods (LP, GA, PSO) and practical implications for decision-makers.
We applied three solution approaches – exact LP (with weight scanning), genetic algorithm, and particle swarm optimization – to the case studies (primarily Case 1 and Case 2, as Case 3 being very small was solved by enumeration). Here we compare their performance and outcomes:
Method | Solution Quality | Computation Time | Strengths | Weaknesses |
---|---|---|---|---|
Exact LP (Weighted Sum) | Optimal (for given weights); True Pareto set (with enough weight variations) | Moderate to High (depends on MILP size and number of runs) | Guarantees finding true Pareto-optimal solutions; provides baseline for small problems. | Scales poorly for large problems (many variables/constraints); finding diverse Pareto points can require many solves; may miss non-convex parts of frontier with simple weighting. |
Genetic Algorithm (NSGA-II like) | Near-optimal Pareto approximation (found all key trade-off solutions in cases) | Low to Moderate (seconds to minutes even for larger scenarios) | Can find a diverse set of solutions in one run; not restricted to convex fronts; easy to adapt constraints and nonlinearities. | Non-deterministic (different runs might give slightly different solutions); requires parameter tuning (population size, etc.); no guarantee of optimality, though good enough in practice. |
Particle Swarm Optimization (MOPSO) | Near-optimal Pareto approximation (found extreme and some intermediate solutions) | Low (often fastest convergence in our tests) | Simple to implement; fast convergence on primary objectives; few parameters; ensures feasibility easily by projection. | Maintaining diversity is a challenge (tended to cluster around a region of the Pareto front); might need multiple runs to get full spread; can get stuck if not enough randomness. |
From Table 5, we see that the exact method was useful as a benchmark for smaller or simplified instances (e.g., verifying the GA/PSO results for Case 1 on a scaled-down problem), but it struggled when the problem size grew. In Case 1 (with ~2 products, 3 suppliers – a small MILP), LP was fine. In a hypothetical larger scenario (say 10 products, 10 suppliers each, which would be 100 continuous variables or more, plus binary selection variables), solving even one MILP is doable, but scanning weights might become tedious. The GA and PSO, on the other hand, easily handle that scale by design.
Our GA implementation (in effect an NSGA-II) performed robustly – it consistently found the extreme solutions that matched those from LP and filled in intermediate ones. For example, in Case 1 the GA population eventually included individuals very close to the cost-minimum (Solution A) and emission-minimum (Solution C) as well as the balanced ones. The PSO also found extreme solutions quickly (like it quickly homed in on sending all to cheapest supplier and all to greenest supplier in Case 1 as two different particles' experiences). However, we noticed PSO had less innate mechanism to preserve a spread – many particles tended to converge to a particular compromise if we didn't intervene. We partly mitigated this by using an archive and ensuring leader selection from different parts of the front, but GA inherently maintained diversity via crowding distance better. Therefore, for generating a full Pareto front approximation, GA was somewhat more effective out-of-the-box. PSO was extremely useful though for quickly improving solutions; often within a few iterations the general shape of the solution was clear (e.g., in Case 2 it quickly identified that donation should be full and toggling between recycle/restock extremes).
In terms of computational efficiency, both GA and PSO were quite fast for our case sizes (populations of 100 for maybe 100 decision variables in Case 1, etc.). GA took ~50 generations to stabilize the Pareto front shape (which is 5000 solution evaluations; trivial for a computer since each evaluation is just arithmetic in our model). PSO with 50 particles and 100 iterations did 5000 evaluations as well and was even faster per iteration due to simplicity. The LP method, if we ran, say, 20 weight scenarios and each solve took around 0.5 seconds (for small MILP), also ended up similar total time (~10 seconds). So for these sizes, any method is fine. But for a much larger scenario (imagine 100 suppliers, etc.), GA/PSO scale roughly linearly with number of evaluations needed (which might need to increase some for complexity but can parallelize, etc.), whereas MILP solve time could blow up exponentially. Thus, the heuristic methods are more scalable for real big procurement problems.
An interesting observation was that all methods agreed on the general shape of trade-offs. For instance, all approaches in Case 2 indicated a sharp bend in the Pareto curve where cost increases rapidly for further emission reduction after a point. This was reflected in all solution sets, giving us confidence in the qualitative findings. In some runs, GA or PSO even found solutions the LP weight-scan initially missed, especially in non-convex regions. For example, in a variant of Case 1 where we introduced a slight penalty making a combination non-convex, the GA could find a solution that the simple weighted sum missed until we used epsilon-constraint. This reinforces that metaheuristics are useful to explore the solution space broadly without the convexity assumption inherent in weighting.
Across the case studies, certain common insights emerge that are valuable to procurement and supply chain decision-makers:
It is also worth noting the robustness of the solutions: sometimes an extreme solution is very sensitive to input assumptions (e.g., if the cost of recycled content supplier increased slightly, Solution B might dominate C more strongly). By looking at a range of solutions, decision-makers are not putting all eggs in one basket – they can see alternative plans. For example, if the refurbished supplier in Case 1 had risk of not delivering, the city might consider also a solution with more of the recycled supplier, even if it cost more, for diversification. The multi-objective approach naturally offers a portfolio of options, which is valuable in contingency planning.
In summary, the results demonstrate that multi-objective optimization is a powerful decision-support tool for sustainable procurement: it quantifies trade-offs, respects constraints, and outputs concrete procurement or supply chain plans rather than just abstract recommendations. By comparing and visualizing these solutions, stakeholders (procurement managers, sustainability officers, financial officers) can have informed discussions about where to set their priorities and what compromises are acceptable. The case studies, while simplified for this report, are indicative of real-world applications: public procurement of eco-friendly products, corporate reverse logistics planning, and sustainable sourcing in manufacturing are all areas actively seeking such analytical approaches:contentReference[oaicite:24]{index=24}:contentReference[oaicite:25]{index=25}. Our framework, validated on these cases, provides a template that can be extended and customized to many other procurement scenarios under the circular economy paradigm.
Despite the encouraging results, we acknowledge several challenges and limitations in both our approach and its practical deployment:
Understanding these challenges highlights areas for future work and improvement, which we discuss in the next section. Nonetheless, acknowledging them also assures that our conclusions are tempered with realism: while optimization provides an idealized set of options under given inputs, practitioners must overlay judgement, risk assessment, and dynamic considerations before final implementation.
Key takeaways from our work include:
Through this research, conducted under the London International Studies and Research Center, we aimed to provide both a theoretical contribution and a practical template for sustainable procurement optimization. The theoretical contribution lies in the integration of multi-objective optimization with circular economy procurement, and the demonstration of how various algorithms perform in this context. The practical contribution is the detailed example of how to model such problems and interpret the results for decision-making. By including formal references and citations, we grounded our work in the context of existing knowledge and provided credibility to the assumptions and data used.
In wrapping up, we emphasize that sustainable procurement should not be seen as a burden or a trade-off against business value, but rather as a multi-criteria optimization problem where innovative solutions can often achieve improvements on multiple fronts. As our results have shown, it is possible to reduce waste and emissions while still controlling costs – the key is to make informed, data-driven decisions that account for the entire system of trade-offs. Multi-objective optimization provides the lens to see those decisions clearly. We encourage organizations and policy-makers to adopt such approaches as they strive to meet the pressing environmental and social challenges of our time without sacrificing economic viability.
Ultimately, aligning procurement with circular economy principles is an investment in long-term sustainability and resilience. The tools and methods outlined in this report can guide that investment by identifying strategies that yield the best overall value across multiple dimensions. We believe that as these analytical approaches become more widespread, they will play a significant role in accelerating the transition to a circular economy, where resource efficiency and ethical considerations become integral to every purchasing decision.