Papers
Topics
Authors
Recent
Search
2000 character limit reached

Advanced Quantitative Techniques to Solve Center of Gravity Problem in Supply Chain

Published 9 Jun 2022 in math.OC and cs.CE | (2206.06156v1)

Abstract: Activities involving transformation of raw materials, various resources and components into final products and also delivering it to the end customer incur a significant cost during the selection of location of a warehouse that can be easily accessed by various actors of the supply chain. To minimize upstream and downstream transportation costs, the center of gravity (CoG) analysis method is used to find the potential warehouse locations for a given demand network which have an impact on the entire supply chain network. Mixed Integer Linear Programming (MILP), an open source tool is developed for implementing CoG method along with certain service level constraints to find optimal potential locations with the least cost. In this paper, an optimization tool has been designed for a forward logistics network with several novel methods like Customer Location Selection (CLS), Customer Packets along with other business heuristics that optimize and enhance the existing MILP to get the optimal solutions with low computational cost and runtime. Finally, recommending an alternative network of facilities which reduces overall costs compared to the existing network. An user interface has also been developed to make a user friendly interaction with the model. We can conclude that this model can significantly help companies reduce costs during the logistics network design.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.