Scenario-based optimisation of a two-tier distribution network with a simplified route construction

摘要

The paper deals with an optimisation of a distribution network design (DND) problem combined with a location routing problem (LRP). A combinatorial model of a two-tier distribution network (DN) is proposed, where the objective function cumulates costs of transport, handling and facilities. A generic mathematical model (GMM) of the problem is constructed, where a function of simplified route construction (FSRC) is suggested to linearize a problem formulation. Additionally, a set of business-oriented constraints is proposed, including facility relocations, regularity changes, time limits of deliveries, and vehicle’s capacity changes. It helps to define several scenario-based extensions of GMM and each scenario is a combination of these constraints. The problem is iteratively solved with exact algorithms. This methodology has been experimentally applied to optimise the DN of drugstore chain, where five alternative scenarios of DN configuration have been tested. Each of them has been optimised and the results have ranged from 7% increase to 30% reduction of objective function, referred to a current state. A recommended scenario assuming 12% cost reduction has been implemented in practice and the expected result has been proved.