Variables clustering method to enable planning of large supply chains
Emilio Bertolotti Fast.square, Milan, Italy.
Abstract
Supply Chain Planning (SCP) problems can be effectively modeled through the Multiobjectives Combinatorial Optimization (MOCO) paradigm. MIP-based “scalarization” techniques (Mixed-Integer Programming) have been successfully exploited for solving SCP optimization problems characterized by numerous conflicting objectives and supply chain–specific constraints. Nevertheless, the planning of complex and large-scale SCP instances remains often a real challenge because of the huge number of decision variables to handle. This chapter presents a new methodology, “Variables Clustering Method” (VCM), that aims at ...
Get Multi-Objective Combinatorial Optimization Problems and Solution Methods now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
