CN109492810A - A method of solving greening supply chain collaborative design problem - Google Patents

A method of solving greening supply chain collaborative design problem Download PDF

Info

Publication number
CN109492810A
CN109492810A CN201811336950.6A CN201811336950A CN109492810A CN 109492810 A CN109492810 A CN 109492810A CN 201811336950 A CN201811336950 A CN 201811336950A CN 109492810 A CN109492810 A CN 109492810A
Authority
CN
China
Prior art keywords
manufacturer
cost
matrix
supplier
represent
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201811336950.6A
Other languages
Chinese (zh)
Inventor
郭羽含
姜彦吉
胡芳霞
王光
杨帆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Liaoning Technical University
Original Assignee
Liaoning Technical University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Liaoning Technical University filed Critical Liaoning Technical University
Priority to CN201811336950.6A priority Critical patent/CN109492810A/en
Publication of CN109492810A publication Critical patent/CN109492810A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/26Government or public services

Abstract

The present invention provides a kind of method for solving greening supply chain collaborative design problem, is related to supply chains design field.Specific step is as follows by the present invention: step 1: the quantity of product or raw material being converted to corresponding means of transport quantity, using cost, carbon emission, water consumption as optimization aim, establishes the supply chain mathematical model of the quaternary structure of integrated manufacturer's selection and Transportation Planning;The mathematical model includes objective function and qualifications;Step 2: the freight volume between optimal supply chain network structure and the structure every two vertex being obtained according to compound out of kilter method, totle drilling cost is obtained according to freight volume and objective function.This method effectively selects optimal supply chain participant combination on the basis of considering cost and environment, and accurately calculates the traffic program between participant, provides the solution of high quality and high efficiency for complexity supply chain.

Description

A method of solving greening supply chain collaborative design problem
Technical field
The present invention relates to supply chains design fields more particularly to a kind of solution greening supply chain collaborative design to ask The method of topic.
Background technique
Supply chain is the network being made of supplier, production plant, center for distribution, client and shipping channels, for obtaining It takes raw material and is translated into product, finally by these product distributions to client.Network Design of Supply Chain (Supply chain Network design, SCND) be optimal facility (supplier, the production plant and center for distribution) position of selection, quantity and Capacity configuration is in important strategic position in supply chain management.Greening supply chain network design (Green supply Chain network design, GSCND) need to comprehensively consider in the design process environmental factor (carbon emission, water pollution), make It is minimum to obtain entire supply chain process effect on environment, level of resources utilization highest.Greening supply chain collaborative design problem is generally adopted It is solved with two step approach, initially sets up the mathematical model of the problem, then the model is carried out using optimization or approximate algorithm It solves.But existing method fails during supply chain design, effectively comprehensively considers carbon emission, water consumption, cost, Establish the mathematical model based on global optimization.Further, since greening supply chain collaborative design problem model is complicated, it is existing optimal It is lower to change method for solving efficiency, large-scale example can not be solved in a short time;And then there is second-rate, the nothing of solution in approximate algorithm Method provides the problem of high quality solution.
Summary of the invention
The technical problem to be solved by the present invention is in view of the above shortcomings of the prior art, provide a kind of solution greening supply chain The method of collaborative design problem, this method effectively select optimal supply on the basis of considering cost and environment Chain participant combination, and the traffic program between participant is accurately calculated, the solution of high quality and high efficiency is provided for complexity supply chain Certainly scheme;
In order to solve the above technical problems, the technical solution used in the present invention is:
A method of greening supply chain collaborative design problem is solved, is included the following steps:
Step 1: the quantity of product or raw material being converted into corresponding means of transport quantity, is disappeared with cost, carbon emission, water Consumption is used as optimization aim, establishes the supply chain mathematical model of the quaternary structure of integrated manufacturer's selection and Transportation Planning;The mathematics Model includes objective function and qualifications, and the formula of the objective function is as follows:
Wherein, i represents vendor number, i ∈ I;J represents manufacturer's number, j ∈ J;K represents retail trader's number, k ∈ K;l Represent customer number, l ∈ L;M represents raw material number, m ∈ M;N representative products number, n ∈ N;CSMimRepresentative is adopted from supplier i Purchase the cost of a unit raw material m;CPPjnRepresent the cost that manufacturer j produces a unit product n;ESMimIt is raw to represent supplier i Produce carbon emission amount caused by a unit raw material m;EPPjnIt represents manufacturer j and produces carbon emission caused by a unit product n Amount;WSMimIt represents supplier i and produces water consumed by a unit raw material m;WPPjnIt represents manufacturer j and produces unit production Water consumed by product n;DSPijRepresent the distance between supplier i and manufacturer j;DPDjkRepresent manufacturer j and retail trader k The distance between;DDCklRepresent the distance between retail trader k and client l;CMPjRepresent operation cost in manufacturer's j period; CMDkRepresent operation cost in the retail trader k period;ETspRepresent the cost of 1 kilometer of Freight Transport;ETspRepresent a lorry Carbon emission caused by 1 kilometer of transport;A, b respectively represent conversion weight when carbon emission, water consumption to be converted to cost;spj It indicates whether to select manufacturer j as supply chain cooperation manufacturer, 1 represents selection, and 0 representative does not select;sdkIndicate whether selection point It sells quotient k and represents selection as supply chain cooperation manufacturer, 1,0 representative does not select;aspmijmIt transports from supplier i to manufacturer j's The quantity of raw material m;apdpjknIt transports from manufacturer j to the quantity of the product n of retail trader k;aSPijFormer material is transported from supplier i Expect to the lorry quantity of manufacturer j;aPDjkThe lorry quantity of product to retail trader k is transported from manufacturer j;aDCklFrom retail trader k Transport the lorry quantity of product to client l;
The qualifications include precondition and constraint condition;
The precondition are as follows: the order of all clients must all meet;Supplier constrains with the supply upper limit, raw Business men has production upper limit constraint, and retail trader has storage upper limit constraint;Each manufacturer, operation cost is solid in retail trader's period It is fixed;Different raw material or product can be merged into same lorry;
The constraint condition are as follows:
Constraint between lorry quantity and raw material, product quantity:
Wherein,ATMmRaw material m can be delivered most by representing a lorry Big quantity;ATPnThe maximum quantity of product n can be delivered by representing a lorry;adcpklnRepresentative is transported from retail trader k to client l Product n quantity;
The order demand of client must satisfy constraint:
Wherein,DlnRepresent the order total amount of client's l ordering products n;
Retail trader inventory constraint:
Wherein,UBStockknRetail trader k is represented to the maximum inventory of product n;
Manufacturer produces force constraint:
Wherein,UBPPjnManufacturer j is represented to the largest production quantity of product n;
Supplier is for stress constraint:
WhereinUBSMimRepresent the maximum quantity for the raw material m that supplier i can be provided;
Retail trader's amount of stocking up, shipment amount are consistent:
Wherein,
Materials procurement quantity and production quantity keep proportion consistent:
i∈Iaspmijm=MPRmn×∑k∈Kapdpjkn (10)
Wherein,MPRmnRepresent the quantitative relation ratio between raw material m and product n Example;
Nonnegative integer and binary system constraint:
spj∈{0,1}(17)
sdk∈{0,1}(18)
Wherein,
Step 2: being obtained between optimal supply chain network structure and the structure every two vertex according to compound out of kilter method Freight volume obtains totle drilling cost according to objective function;
The compound out of kilter method is to be integrated by the alternative manufacturer to supply quotient sheaf, raw vendor level and distributor level Assessment obtains the manufacturer with preferably assessment score;The manufacturer includes supply quotient sheaf, production quotient sheaf, distributor level;It enumerates The all possible combinations being made of these manufacturers delete the candidate solution for not being able to satisfy customer order wherein as candidate disaggregation;And To remaining each candidate solution calculating target function approximation, the smallest candidate solution of selection target function approximation is as final confession Chain network structure is answered, branch and bound method is reapplied to calculate the freight volume between every two vertex, freight volume is brought into target Totle drilling cost is acquired in function.
Specific step is as follows for the step 2:
Step 2.1: the high supply quotient set S of comprehensive score, production quotient set P, distribution are obtained according to partner's out of kilter method Quotient set D;
Partner's out of kilter method is assessment score to be calculated for candidate manufacturer, and obtain each candidate manufacturer using weighting adduction Comprehensive score;Using the top k algorithm based on quicksort, the high preceding η supplier of comprehensive score, raw factory are selected respectively Quotient and retail trader obtain supply quotient set S, production quotient set P, distribution quotient set D;
Step 2.2: candidate disaggregation CS is obtained according to candidate solution enumeration;
The candidate solution enumeration be preferentially after supply quotient set S, production quotient set P, distribution quotient set D and client Set C;It finds out respectively and is made of set S ', P ', D ' all subsets in addition to empty set of S, P, D, the set C ' that the complete or collected works of C are constituted, Then all candidate solutions of GSCND are obtained by the orderly cartesian product of S ', P ', D ', C ';
Step 2.3: infeasible candidate solution is deleted according to infeasible solution deletion algorithm;
The infeasible solution deletion algorithm is to be directed to supply quotient sheaf, production quotient sheaf, distributor level respectively according to precondition Judged, if this layer of manufacturer's ability is not able to satisfy all customer order demands, the candidate solution be it is invalid, delete this Trivial solution;The input data of the algorithm is S ', P ', D ', and output data is S ", P ", D ", and the S ", P ", D " respectively indicate deletion Supply quotient set, production quotient set, distribution quotient set after infeasible solution;
Step 2.4: the filter algorithm based on objective function approximation obtains the totle drilling cost of supply chain network;
The filter algorithm based on objective function approximation is filtered remaining candidate according to obtained in step 2.3 Solution, to each candidate solution calculating target function approximation, selection target function approximation is the smallest to be deconstructed into final supply chain Network;It reapplies branch and bound method and obtains the freight volume between adjacent two layers vertex, freight volume is brought into objective function and is acquired Totle drilling cost.
Specific step is as follows for the step 2.1:
Step 2.1.1: evaluation index when listing supplier, manufacturer, retail trader respectively preferentially;To each index, press It is different according to its shared specific gravity in the value of objective function, assign different weights;
Step 2.1.1.1: the vendors' evaluating index includes each cost of raw, each raw material carbon emission pair The cost answered, the corresponding cost of each raw material water consumption are transported from supplier to the cost of manufacturer;The specific method is as follows:
Enable PNnIndicate the order total amount of product n, MNmRepresent the total demand of raw material m;Formula is as follows:
Each cost of raw:
(∑i∈ICSMim/|I|)×MNm (21)
The corresponding cost of each raw material carbon emission:
a×(∑i∈IESMim/|I|)×MNm (22)
The corresponding cost of each raw material water consumption:
a×(∑i∈IWSMim/|I|)×MNm (23)
It transports from supplier to the cost of manufacturer:
Select a kind of cost of raw material as with reference to cost, weight is set as 1;The weight of other indices is according to it The ratio of corresponding cost and reference cost determines;
The weight for enabling the first cost of raw material is 1, i.e. m=1;The cost weight WSC of raw material mm, raw material m carbon Discharge weight WSEm, raw material m water consumption weight WSWm, it is as follows with the calculation formula of manufacturer's distance weighting WSP:
Step 2.1.1.2: the evaluation index of the manufacturer includes the cost of each production of manufacturer, each production The corresponding cost of carbon emission, the corresponding cost of each production water consumption, operation cost, from supplier transport to manufacturer at Originally, transport from manufacturer to retail trader's cost;
Each index average value is taken, it is calculated separately and is produced from supplier's transporting raw materials to manufacturer, production product and transport Cost caused by product to retail trader's stage;The weight for enabling one of production cost is 1, the weights of other indexs according to Its corresponding cost is determined with the ratio referring to cost;
The cost of each production:
(∑j∈JCPPjn/|J|)×PNn (29)
The corresponding cost of each production carbon emission:
a×(∑j∈JEPPjn/|J|)×PNn (30)
The corresponding cost of each production water consumption:
b×(∑j∈JWPPjn/|J|)×PNn (31)
Operation cost:
It transports from supplier to manufacturer's cost:
It transports from manufacturer to retail trader's cost:
The weight for enabling the first production cost is 1, i.e. n=1;The production cost weight WPC of product nn, product n Produce carbon emission weight WPEn, product n production water consumption weight WPWn, operation cost weight WPM, with supplier's distance weighting It is WPS, as follows with the calculation formula of retail trader distance weighting WPD:
Step 2.1.1.3: the evaluation index of retail trader include: operation cost, the cost transported from manufacturer to retail trader, It transports from retail trader to the cost of client;
Each index average value is taken, it is calculated separately from manufacturer and transports product to retail trader again to caused by client's stage Cost is averaged and is calculated;The weight for enabling operation cost is 1, and the weight of other indexs is according to its corresponding cost and reference The ratio of cost determines;
Operation cost:
It transports from manufacturer to the cost of retail trader:
It transports from retail trader to the cost of client:
Enabling the weight WDM of operation cost is 1, and the calculating with manufacturer's distance weighting WDP and client's distance weighting WDC is public Formula is as follows:
WDM=1 (44)
Step 2.1.2: comprehensive score is carried out to manufacturer respectively;
Each evaluation index same level manufacturer is compared respectively, with 0-1 matrix storage comparative result, ranks are indicated Manufacturer, matrix element indicate that row whether better than column, is that element value takes 1, otherwise takes 0;According still further to the weight of each index, to 0-1 Matrix is weighted addition, obtains score matrix, sums to the matrix by rows, obtains the comprehensive score of the manufacturer;Specific steps It is as follows:
Step 2.1.2.1: the comprehensive score of supplier;
Each cost of raw material compares matrix:
Am=[αoq]I×I (47)
Wherein, αoqRepresent matrix AmIn element;o,q∈I,CSMomIt represents from supplier o and purchases a unit raw material m's Cost;CSMqmRepresent the cost that a unit raw material m is purchased from supplier q;
Each raw material carbon emission compares matrix:
Bm=[βoq]I×I (48)
Wherein, βoqRepresent matrix BmIn element;ESMomIt represents supplier o and produces carbon caused by a unit raw material m Discharge amount;ESMqmIt represents supplier q and produces carbon emission amount caused by a unit raw material m;
Each raw material water consumption compares matrix:
Qm=[ρoq]I×I (49)
Wherein, ρoqMatrix QmIn element;WSMomIt represents supplier o and produces water consumed by a unit raw material m; WSMqmIt represents supplier q and produces water consumed by a unit raw material m;
With each manufacturer's distance versus matrix:
Wj=[μoq]I×I (50)
Wherein, μoqRepresent matrix WjIn element;DSPojRepresent the distance between supplier o and manufacturer j;DSPqjGeneration The distance between table supplier o and manufacturer j;
Addition is weighted according to the weight being calculated in step 2.1.1.1 to above-mentioned comparison matrix, obtains supplier Comparison score matrix between two-by-two:
The comprehensive score formula of supplier is obtained by row summation to matrix T1 again:
The comprehensive score set TS1 of all suppliers is obtained by above-mentioned formula;
Step 2.1.2.2: the comprehensive score of manufacturer;
Each production Cost comparisons matrix:
En=[euv]|J|×|J| (53)
Wherein, euvRepresent matrix EnIn element;u,v∈J;CPPunRepresent manufacturer u produce a unit product n at This;CPPvnRepresent the cost that manufacturer v produces a unit product n;
Each production carbon emission compares matrix:
Fn=[fuv]|J|×|J| (54)
Wherein, fuvRepresent matrix FnIn element;EPPunIt represents manufacturer u and produces the row of carbon caused by a unit product n High-volume;EPPvnIt represents manufacturer v and produces carbon emission amount caused by a unit product n;
Each production water consumption compares matrix:
Gn=[guv]|J|×|J| (55)
Wherein, guvRepresent matrix GnIn element;WPPunIt represents manufacturer u and produces water consumed by a unit product n; WPPvnIt represents manufacturer v and produces water consumed by a unit product n;
Operation cost compares matrix:
H=[huv]|J|×|J| (56)
Wherein, huvRepresent the element in matrix H;CMPuRepresent operation cost in manufacturer's u period;CMPvRepresent manufacturer Operation cost in the v period;
With the set S distance versus matrix of supplier:
Oi′=[δuv]|J|×|J| (57)
Wherein, δuvRepresent matrix Oi′In element;S represents the set of the supplier obtained using top k algorithm;I '= 1,2,…,η;DSPi′uRepresent the distance between supplier i ' and manufacturer u;DSPi′vIt represents between supplier i ' and manufacturer v Distance;
With each retail trader's distance versus matrix:
Uk=[εuv]|J|×|J| (58)
Wherein, εuvRepresent matrix UkIn element;DPDukThe distance between manufacturer u and retail trader k;DPDvkManufacturer v The distance between retail trader k;
Addition is weighted according to the weight being calculated in step 2.1.1.2 to above-mentioned comparison matrix, obtains manufacturer Comparison score matrix between two-by-two:
The comprehensive score formula of manufacturer is obtained by row summation to matrix T2 again:
The comprehensive score set TS2 of all manufacturers is obtained by above-mentioned formula;
Step 2.1.2.3: the comprehensive score of retail trader;
Operation cost compares matrix:
L '=[θwy]|K|×|K| (61)
Wherein, θwyRepresent matrix L ' in element;w,y∈K;CMDwRepresent operation cost in the retail trader w period;CMDyGeneration Operation cost in the table retail trader y period;
With the set P distance versus matrix of manufacturer:
Wherein, xwyRepresent matrix Xj′In element;P represents the production quotient set obtained using top k algorithm;J '=1, 2,…,η;DPDj′wRepresent the distance between manufacturer j ' and retail trader w;DPDj′yIt represents between manufacturer j ' and retail trader y Distance;
With each client's distance versus matrix:
Vl=[zwy]|K|×|K| (63)
Wherein, zwyRepresent matrix VlIn element;DDCwlRepresent the distance between retail trader w and client l;DDCylIt represents The distance between retail trader y and client l;
Addition is weighted according to the weight being calculated in step 2.1.1.3 to above-mentioned comparison matrix, obtains retail trader Comparison score matrix between two-by-two:
The comprehensive score formula of retail trader is obtained by row summation to matrix T3 again:
The comprehensive score set TS3 of all retail traders is obtained by above-mentioned formula;
Step 2.1.3: the comprehensive score obtained according to step 2.1.2, the top k algorithm based on quicksort are integrated Score high preceding η supply quotient set S, production quotient set P, distribution quotient set D;Specific step is as follows:
Step 2.1.3.1: a base value is found in supplier comprehensive score set TS1;The base value chooses number The value of the last one element in group;
Step 2.1.3.2: element bigger than base value in the set is placed in its left side, the member smaller than base value by subregion Element is placed in its right side;
Step 2.1.3.3: judging left siding-to-siding block length, is such as equal to η, program determination, η element before exporting;As left section is long Degree is greater than η, then repeats step 2.3.1.1 and step 2.3.1.2 to left section, until program determination;As left siding-to-siding block length is less than η then repeats step 2.3.1.1 and step 2.3.1.2 to right section, until program determination;
Step 2.1.3.4: the η element that step 2.1.3.3 is exported is denoted as supply quotient set S;
Step 2.1.3.5: a base value is found in manufacturer's comprehensive score set TS2;Execute step 2.1.3.2 and Step 2.1.3.3, η element before exporting are denoted as production quotient set P;
Step 2.1.3.6: a base value is found in retail trader comprehensive score set TS3;Execute step 2.1.3.2 and Step 2.1.3.3, η element before exporting are denoted as distribution quotient set D.
Specific step is as follows for the step 2.2:
Step 2.2.1: construction setC '={ C }, In 2S、2P、2DThe respectively power set of set S, P, D;
Step 2.2.2: obtaining set S ', P ', D ' according to bit arithmetic, wherein | S ' |=2I- 1, | P ' |=2J- 1, | D ' |= 2K- 1, | C ' |=1, to obtain candidate disaggregation CS:
CS=(2I-1)×(2J-1)×(2K-1) (66)
Specific step is as follows for the step 2.3:
Step 2.3.1: supply quotient sheaf: for the supplier S in S 'iIfThen by SiIt is added to set S ";
Step 2.3.2: production quotient sheaf: for the manufacturer P in P 'iIfThen By PiIt is added to set P ";
Step 2.3.3: distributor level: for the manufacturer D in D 'iIf Then by DiIt is added to set D ".
The specific steps of objective function approximation are solved in the step 2.4 are as follows:
The cost CSM of each raw material of supplier in remaining candidate solutionm, carbon emission ESMm, water consumption WSMmCalculation formula such as Under:
The cost CPP of each production of manufacturer in remaining candidate solutionn, carbon emission EPPn, water consumption WPPnCalculation formula It is as follows:
Distance Dis, the Dis in remaining candidate solution between manufacturer include that supplier transports to manufacturer, manufacturer's transport It transports to retail trader, retail trader to lorry quantity TSP, TPD, TDC of client, calculation formula is as follows:
Objective function approximation ObjapprFormula are as follows:
The beneficial effects of adopting the technical scheme are that a kind of solution greening supply chain association provided by the invention With the method for design problem;This method using cost, carbon emission, water consumption as optimization aim, establish integrated manufacturer's selection and The supply chain mathematical model of the quaternary structure of Transportation Planning.Meanwhile an effective method for solving is proposed, former problem is divided into Partner selection subproblem and Transportation Planning subproblem, the method approached using multistep are latent by the way that multiple strobe utilities removals are arranged Infeasible solution, and calculate an approximate objective function value further to be selected.Finally, selection has minimum close Like the candidate solution of value, the freight volume between connection vertex is determined using branch and bound method, and calculates final goal functional value. Experiments verify that the algorithm can provide the solution of high-quality and high-efficiency for complicated supply chain.
Detailed description of the invention
Fig. 1 is the method flow diagram provided in an embodiment of the present invention for solving greening supply chain collaborative design problem;
Fig. 2 is supply chain network structure chart provided in an embodiment of the present invention;
Fig. 3 is compound out of kilter method main thought figure provided in an embodiment of the present invention;
Specific embodiment
With reference to the accompanying drawings and examples, specific embodiments of the present invention will be described in further detail.Implement below Example is not intended to limit the scope of the invention for illustrating the present invention.
The method of the present embodiment is as described below.
As shown in Fig. 2, using digraph G=<V, one level Four greening supply chain network of E>simulation, each vertex v * ∈ V A potential supply chain partner (such as supplier) is represented, vertex set is made of four kinds of different types of affiliates: supply Quotient, manufacturer, retail trader and client, each edge in Fig. 2 represent the quantity of transporting raw materials or product between vertex, and only The vertex of two adjacent layers can connect (such as supply quotient sheaf and production quotient sheaf).Its target is to select to close from corresponding level The manufacturer of suitable quantity, to meet the order of each client and be no more than the energy power limit of each manufacturer, and determining transport quantity (vi, vj)。
In order to which supply-chain integration is included in environment influence, this method considers production other than considering cost The carbon emission that is generated in transportational process, water consumption founding mathematical models.In addition, product or raw material are usual in practical logistics It is transported from a website to another website by certain means of transportation.Therefore, according to the quantity of means of transport rather than product Or the quantity calculating total transport cost of raw material is more accurate.So this method passes through constraint condition for product or the number of raw material Amount is converted to corresponding means of transport quantity, and ensures high charging ratio.Then, total transport is calculated based on the quantity of means of transport Cost, this is entirely different with previous method.
A method of greening supply chain collaborative design problem being solved, as shown in Figure 1, including the following steps:
Step 1: the quantity of product or raw material being converted into corresponding means of transport quantity, is disappeared with cost, carbon emission, water Consumption is used as optimization aim, establishes the supply chain mathematical model of the quaternary structure of integrated manufacturer's selection and Transportation Planning;The mathematics Model includes objective function and qualifications, and the formula of the objective function is as follows:
Wherein, i represents vendor number, i ∈ I;J represents manufacturer's number, j ∈ J;K represents retail trader's number, k ∈ K;l Represent customer number, l ∈ L;M represents raw material number, m ∈ M;N representative products number, n ∈ N;CSMimRepresentative is adopted from supplier i Purchase the cost of a unit raw material m;CPPjnRepresent the cost that manufacturer j produces a unit product n;ESMimIt is raw to represent supplier i Produce carbon emission amount caused by a unit raw material m;EPPjnIt represents manufacturer j and produces carbon emission caused by a unit product n Amount;WSMimIt represents supplier i and produces water consumed by a unit raw material m;WPPjnIt represents manufacturer j and produces unit production Water consumed by product n;DSPijRepresent the distance between supplier i and manufacturer j;DPDjkRepresent manufacturer j and retail trader k The distance between;DDCklRepresent the distance between retail trader k and client l;CMPjRepresent operation cost in manufacturer's j period; CMDkRepresent operation cost in the retail trader k period;CTSpRepresent the cost of 1 kilometer of Freight Transport;ETspRepresent a lorry Carbon emission caused by 1 kilometer of transport;A, b respectively represent conversion weight when carbon emission, water consumption to be converted to cost;spj It indicates whether to select manufacturer j as supply chain cooperation manufacturer, 1 represents selection, and 0 representative does not select;sdkIndicate whether selection point It sells quotient k and represents selection as supply chain cooperation manufacturer, 1,0 representative does not select;aspmijmIt transports from supplier i to manufacturer j's The quantity of raw material m;apdpjknIt transports from manufacturer j to the quantity of the product n of retail trader k;aSPijFormer material is transported from supplier i Expect to the lorry quantity of manufacturer j;aPDjkThe lorry quantity of product to retail trader k is transported from manufacturer j;aDCklFrom retail trader k Transport the lorry quantity of product to client l;
Cost in the model include cost of raw, production cost, supplier to manufacturer transport at Sheet, the transportation cost of manufacturer to retail trader, retail trader to client transportation cost;Carbon emission includes that raw material production process produces The discharge that raw discharge, production discharge and cargo transport generates in the process;Water consumption include raw material production consumption and Production consumption.
Qualifications include precondition and constraint condition;
The precondition are as follows: the order of all clients must all meet;Supplier constrains with the supply upper limit, raw Business men has production upper limit constraint, and retail trader has storage upper limit constraint;Each manufacturer, operation cost is solid in retail trader's period It is fixed;Different raw material or product can be merged into same lorry;
The constraint condition are as follows:
Constraint between lorry quantity and raw material, product quantity:
Wherein,ATMmThe maximum of raw material m can be delivered by representing a lorry Quantity;ATPnThe maximum quantity of product n can be delivered by representing a lorry;adcpklnRepresentative is transported from retail trader k to client l's The quantity of product n;
The order demand of client must satisfy constraint:
Wherein,DlnRepresent the order total amount of client's l ordering products n;
Retail trader inventory constraint:
Wherein,UBStockknRetail trader k is represented to the maximum inventory of product n;
Manufacturer produces force constraint:
Wherein,UBPPjnManufacturer j is represented to the largest production quantity of product n;
Supplier is for stress constraint:
WhereinUBSMimRepresent the maximum quantity for the raw material m that supplier i can be provided;
Retail trader's amount of stocking up, shipment amount are consistent:
Wherein,
Materials procurement quantity and production quantity keep proportion consistent:
i∈Iaspmijm=MPRmn×∑k∈Kapdpjkn (10)
Wherein,MPRmnRepresent the quantitative relation ratio between raw material m and product n Example;
Nonnegative integer and binary system constraint:
spj∈{0,1}(17)
sdk∈{0,1}(18)
Wherein,
Step 2: being obtained between optimal supply chain network structure and the structure every two vertex according to compound out of kilter method Freight volume obtains totle drilling cost according to objective function;
The compound out of kilter method is to be integrated by the alternative manufacturer to supply quotient sheaf, raw vendor level and distributor level Assessment obtains the manufacturer with preferably assessment score;The manufacturer includes supply quotient sheaf, production quotient sheaf, distributor level;It enumerates The all possible combinations being made of these manufacturers delete the candidate solution for not being able to satisfy customer order wherein as candidate disaggregation;And To remaining each candidate solution calculating target function approximation, the smallest candidate solution of selection target function approximation is as final confession Chain network structure is answered, branch and bound method is reapplied to calculate the freight volume between every two vertex, freight volume is brought into target Totle drilling cost is acquired in function.
For GSCND, a kind of direct method is exactly to enumerate the combination of all candidate buddies, deletes infeasible combination, Then the freight volume between two vertex is calculated, final choice has the combination of minimum target functional value as optimal solution party Case.However, it is unpractical for calculating all combinations.Therefore, method proposes a kind of effective approximation methods --- and it is compound to select Excellent algorithm, by reducing solution space gradually come the optimal solution of approximation problem.Firstly, to supply quotient sheaf, raw vendor level and retail trader The alternative manufacturer of layer carries out comprehensive assessment, and there is the manufacturer of preferably assessment score to enter and calculate in next step.Then, it enumerates by this The all possible combinations that a little manufacturers are constituted as candidate disaggregation, (i.e. can not by the candidate solution that deletion is not able to satisfy customer order wherein Row solution), an objective function approximation is calculated to remaining each candidate solution, the smallest candidate solution of selection target function approximation is made For final supply chain network structure.Finally, calculating the freight volume between every two vertex using branch and bound method, this is obtained The approximate solution of problem.The subalgorithm applied in the overall structure of this method and each step is as shown in Figure 3;
Specific step is as follows:
Step 2.1: the high supply quotient set S of comprehensive score, production quotient set P, distribution are obtained according to partner's out of kilter method Quotient set D;
Partner's out of kilter method is assessment score to be calculated for candidate manufacturer, and obtain each candidate manufacturer using weighting adduction Comprehensive score;Using the top k algorithm based on quicksort, the high preceding η supplier of comprehensive score, raw factory are selected respectively Quotient and retail trader obtain supply quotient set S, production quotient set P, distribution quotient set D;
Step 2.1.1: evaluation index when listing supplier, manufacturer, retail trader respectively preferentially;To each index, press It is different according to its shared specific gravity in target function value, assign different weights;
Step 2.1.1.1: the vendors' evaluating index includes each cost of raw, each raw material carbon emission pair The cost answered, the corresponding cost of each raw material water consumption are transported from supplier to the cost of manufacturer;The specific method is as follows:
Select a kind of cost of raw material as with reference to cost, weight is set as 1;The weight of other indices is according to it The ratio of corresponding cost and reference cost determines;
Enable PNnIndicate the order total amount of product n, MNmRepresent the total demand of raw material m.Then have:
Each cost of raw:
The corresponding cost of each raw material carbon emission:
The corresponding cost of each raw material water consumption:
It transports from supplier to the cost of manufacturer:
The weight for enabling the first cost of raw material (m=1) is 1;The cost weight WSC of raw material mm, raw material m carbon row Delegate power weight WSEm, raw material m water consumption weight WSWm, it is as follows with the calculation formula of manufacturer's distance weighting WSP.
Step 2.1.1.2: the evaluation index of the manufacturer includes the cost of each production of manufacturer, each production The corresponding cost of carbon emission, the corresponding cost of each production water consumption, operation cost, from supplier transport to manufacturer at Originally, transport from manufacturer to retail trader's cost;
Each index average value is taken, it is calculated separately and is produced from supplier's transporting raw materials to manufacturer, production product and transport Cost caused by product to retail trader's stage.The weight for enabling one of production cost is 1, the weights of other indexs according to Its corresponding cost is determined with the ratio referring to cost;
The cost of each production:
(∑j∈JCPPjn/|J|)×PNn (29)
The corresponding cost of each production carbon emission:
a×(∑j∈JEPPjn/|J|)×PNn (30)
The corresponding cost of each production water consumption:
b×(∑j∈JWPPjn/|J|)×PNn (31)
Operation cost:
It transports from supplier to manufacturer's cost:
It transports from manufacturer to retail trader's cost:
The weight for enabling the first production cost (n=1) is 1.The production cost weight WPC of product nn, product n life Produce carbon emission weight WPEn, product n production water consumption weight WPWn, operation cost weight WPM, with supplier's distance weighting It is WPS, as follows with the calculation formula of retail trader distance weighting WPD.
Step 2.1.1.3: the evaluation index of retail trader include: operation cost, the cost transported from manufacturer to retail trader, It transports from retail trader to the cost of client;
Each index average value is taken, it is calculated separately from manufacturer and transports product to retail trader again to caused by client's stage Cost is averaged and is calculated.The weight for enabling operation cost is 1, and the weight of other indexs is according to its corresponding cost and reference The ratio of cost determines;
Operation cost:
It transports from manufacturer to the cost of retail trader:
It transports from retail trader to the cost of client:
Enabling the weight WDM of operation cost is 1, and the calculating with manufacturer's distance weighting WDP and client's distance weighting WDC is public Formula is as follows.
WDM=1 (44)
Step 2.1.2: comprehensive score is carried out to manufacturer;
To each evaluation index same level, manufacturer compares two-by-two, and with 0-1 matrix storage comparative result;The equal table of ranks Show manufacturer, matrix element indicates that row represents manufacturer and whether is better than column and represents manufacturer, is that element value takes 1, otherwise takes 0;According still further to every The weight of a index is weighted addition to 0-1 matrix, and Comparison score matrix between obtaining manufacturer two-by-two asks the matrix by rows With obtain the total score of each manufacturer;Specific step is as follows:
Step 2.1.2.1: the comprehensive score of supplier;
Each cost of raw material compares matrix:
Am=[αoq]I×I (47)
Wherein, αoqRepresent matrix AmIn element;o,q∈I,CSMomIt represents from supplier o and purchases a unit raw material m's Cost;CSMqmRepresent the cost that a unit raw material m is purchased from supplier q;
Each raw material carbon emission compares matrix:
Bm=[βoq]I×I (48)
Wherein, βoqRepresent matrix BmIn element;ESMomIt represents supplier o and produces carbon caused by a unit raw material m Discharge amount;ESMqmIt represents supplier q and produces carbon emission amount caused by a unit raw material m;
Each raw material water consumption compares matrix:
Qm=[ρ oq]I×I (49)
Wherein, ρoqMatrix QmIn element;WSMomIt represents supplier o and produces water consumed by a unit raw material m; WSMqmIt represents supplier q and produces water consumed by a unit raw material m;
With each manufacturer's distance versus matrix:
Wj=[μoq]I×I (50)
Wherein, μoqRepresent matrix WjIn element;DSPojRepresent the distance between supplier o and manufacturer j;DSPqjGeneration The distance between table supplier o and manufacturer j;
Addition is weighted according to the weight being calculated in step 2.1.1.1 to above-mentioned comparison matrix, obtains supplier Comparison score matrix between two-by-two:
The comprehensive score formula of supplier is obtained by row summation to matrix T1 again:
The comprehensive score set TS1 of all suppliers is obtained by above-mentioned formula;
Step 2.1.2.2: the comprehensive score of manufacturer;
Each production Cost comparisons matrix:
En=[euv]|J|×|J| (53)
Wherein, euvRepresent matrix EnIn element;u,v∈J;CPPunRepresent manufacturer u produce a unit product n at This;CPPvnRepresent the cost that manufacturer v produces a unit product n;
Each production carbon emission compares matrix:
Fn=[fuv]|J|×|J| (54)
Wherein, fuvRepresent matrix FnIn element;EPPunIt represents manufacturer u and produces the row of carbon caused by a unit product n High-volume;EPPvnIt represents manufacturer v and produces carbon emission amount caused by a unit product n;
Each production water consumption compares matrix:
Gn=[guv]|J|×|J| (55)
Wherein, guvRepresent matrix GnIn element;WPPunIt represents manufacturer u and produces water consumed by a unit product n; WPPvnIt represents manufacturer v and produces water consumed by a unit product n;
Operation cost compares matrix:
H=[huv]|J|×|J| (56)
Wherein, huvRepresent the element in matrix H;CMPuRepresent operation cost in manufacturer's u period;CMPvRepresent manufacturer Operation cost in the v period;
With the set S distance versus matrix of supplier:
Oi′=[δuv]|J|×|J| (57)
Wherein, δuvRepresent matrix Oi′In element;S represents the set of the supplier obtained using top k algorithm;I '= 1,2,…,η;DSOi′uRepresent the distance between supplier i ' and manufacturer u;DSPi′vIt represents between supplier i ' and manufacturer v Distance;
With each retail trader's distance versus matrix:
Uk=[εuv]|J|×|J| (58)
Wherein, εuvRepresent matrix UkIn element;DPDukThe distance between manufacturer u and retail trader k;DPDvkManufacturer v The distance between retail trader k;
Addition is weighted according to the weight being calculated in step 2.1.1.2 to above-mentioned comparison matrix, obtains manufacturer Comparison score matrix between two-by-two:
The comprehensive score formula of manufacturer is obtained by row summation to matrix T2 again:
The comprehensive score set TS2 of all manufacturers is obtained by above-mentioned formula;
Step 2.1.2.3: the comprehensive score of retail trader;
Operation cost compares matrix:
L '=[θwy]|K|×|K| (51)
Wherein, θwyRepresent matrix L ' in element;w,y∈K;CMDwRepresent operation cost in the retail trader w period;CMDyGeneration Operation cost in the table retail trader y period;
With the set P distance versus matrix of manufacturer:
Wherein, xwyRepresent matrix Xj′In element;P represents the production quotient set obtained using top k algorithm;J '=1, 2,…,η;DPDj′wRepresent the distance between manufacturer j ' and retail trader w;DPDj′yIt represents between manufacturer j ' and retail trader y Distance;
With each client's distance versus matrix:
Vl=[zwy]|K|×|K| (63)
Wherein, zwyRepresent matrix VlIn element;DDCwlRepresent the distance between retail trader w and client l;DDCylIt represents The distance between retail trader y and client l;
Addition is weighted according to the weight being calculated in step 2.1.1.3 to above-mentioned comparison matrix, obtains retail trader Comparison score matrix between two-by-two:
The comprehensive score formula of retail trader is obtained by row summation to matrix T3 again:
The comprehensive score set TS3 of all retail traders is obtained by above-mentioned formula;
Step 2.1.3: the comprehensive score obtained according to step 2.1.2, the top k algorithm based on quicksort are integrated Score high preceding η supply quotient set S, production quotient set P, distribution quotient set D;Specific step is as follows:
Step 2.1.3.1: a base value is found in supplier comprehensive score set TS1;The base value chooses number The value of the last one element in group;
Step 2.1.3.2: element bigger than base value in the set is placed in its left side, the member smaller than base value by subregion Element is placed in its right side;
Step 2.1.3.3: judging left siding-to-siding block length, is such as equal to η, program determination, η element before exporting;As left section is long Degree is greater than η, then repeats step 2.3.1.1 and step 2.3.1.2 to left section, until program determination;As left siding-to-siding block length is less than η then repeats step 2.3.1.1 and step 2.3.1.2 to right section, until program determination;
Step 2.1.3.4: the η element that step 2.1.3.3 is exported is denoted as supply quotient set S;
Step 2.1.3.5: a base value is found in manufacturer's comprehensive score set TS2;Execute step 2.1.3.2 and Step 2.1.3.3, η element before exporting are denoted as production quotient set P;
Step 2.1.3.6: a base value is found in retail trader comprehensive score set TS3;Execute step 2.1.3.2 and Step 2.1.3.3, η element before exporting are denoted as distribution quotient set D.
Step 2.2: candidate disaggregation CS is obtained according to candidate solution enumeration;
The candidate solution enumeration be preferentially after supply quotient set S, production quotient set P, distribution quotient set D and client Set C;It finds out respectively and is made of set S ', P ', D ' all subsets in addition to empty set of S, P, D, the set C ' that the complete or collected works of C are constituted, Then all candidate solutions of GSCND are obtained by the orderly cartesian product of S ', P ', D ', C ';
Specific step is as follows:
Step 2.2.1: construction setC '={ C }, In 2S、2P、2DThe respectively power set of set S, P, D;
Step 2.2.2: obtaining set S ', P ', D ' according to bit arithmetic, wherein | S ' |=2I- 1, | P ' |=2J- 1, | D ' |= 2K- 1, | C ' |=1, to obtain candidate disaggregation CS:
CS=(2I-1)×(2J-1)×(2K-1) (66)
Step 2.3: infeasible candidate solution is deleted according to infeasible solution deletion algorithm;
The infeasible solution deletion algorithm is to be directed to supply quotient sheaf, production quotient sheaf, distributor level respectively according to precondition Judged, if this layer of manufacturer's ability is not able to satisfy all customer order demands, the candidate solution be it is invalid, delete this Trivial solution;The input data of the algorithm is S ', P ', D ', and output data is S ", P ", D ", and the S ", P ", D " respectively indicate deletion Supply quotient set, production quotient set, distribution quotient set after infeasible solution;Algorithm flow is as follows:
For the GSCND of the medium and above scale, candidate solution quantity be it is very huge, to be found from numerous candidate solutions Optimal solution, it is clear that solution efficiency is very low.Therefore, it method proposes a kind of filter method based on each manufacturer's capacity consistency, deletes Remove a large amount of infeasible candidate solution.According to the two important premises proposed in precondition, it may be assumed that the order of all clients must Must all it meet;There are certain capacity consistency in each supplier, manufacturer, retail trader.
Therefore, can be judged respectively for supply quotient sheaf, production quotient sheaf, distributor level, if this layer of manufacturer's ability It is not able to satisfy all customer order demands, then the candidate solution is invalid.For example, candidate solution S1 S3 | P1 P2 | D1 | C1 C2, If the sum of S1 S3 raw material supply ability is not able to satisfy all customer orders, the candidate solution that all supply quotient sheafs are S1 S3 It is all invalid.Similarly, for producing quotient sheaf, if the sum of the production capacity of P1 P2 is not able to satisfy customer order, all lifes Business men layer is that the candidate solution of P1 P2 is all invalid.And, the stock ability of each retail trader must similarly, for distributor level Customer order must be met.
Based on the thinking, method proposes supplier, manufacturer, three layers of retail trader filter algorithm, wherein inputting number All suppliers for being enumerated according to S ', P ', D ' expression, manufacturer, retail trader's combination set, S ", P ", D " are returning for algorithm Value is returned, indicates filtered manufacturer's composite set.In this way, numerous invalid candidate solutions can be deleted, solution space is reduced.
Step 2.3.1: supply quotient sheaf: for the supplier S in S 'iIfThen by SiIt is added to set S ";
Step 2.3.2: production quotient sheaf: for the manufacturer P in P 'iIfThen By PiIt is added to set P ";
Step 2.3.3: distributor level: for the manufacturer D in D 'iIf Then by DiIt is added to set D ";
Step 2.4: the filter algorithm based on objective function approximation obtains the totle drilling cost of supply chain network;
The filter algorithm based on objective function approximation is filtered remaining candidate according to obtained in step 2.3 Solution, to each candidate solution calculating target function approximation, selection target function approximation is the smallest to be deconstructed into final supply chain Network;It reapplies branch and bound method and obtains the freight volume between adjacent two layers vertex, freight volume is brought into objective function and is acquired Totle drilling cost.
Solve the specific steps of objective function approximation are as follows:
Each cost of raw material CSM of supplier in remaining candidate solutionm, carbon emission ESMm, water consumption WSMmCalculation formula such as Under:
Each production cost CPP of manufacturer in remaining candidate solutionn, carbon emission EPPn, water consumption WPPnCalculation formula It is as follows:
Distance Dis, the Dis in remaining candidate solution between manufacturer include that supplier transports to manufacturer, manufacturer's transport It transports to retail trader, retail trader to lorry quantity TSP, TPD, TDC of client, calculation formula is as follows:
Objective function approximation ObjapprFormula are as follows:
All codes are all made of java realization in the present embodiment, and specific experiment environment configurations are as shown in table 1:
The configuration of 1 experimental situation of table
In the present embodiment | S |=| P |=| D |=| C |=50, preferentially number η takes 5 for manufacturer, obtains supplier through this method 5 manufacturer of top after layer, production quotient sheaf, distributor level synthesis point, as shown in table 2, transporting raw materials or product quantity between manufacturer As shown in table 3, the lorry quantity of transporting raw materials or product is as shown in table 4 between manufacturer;
2 manufacturer of table preferentially result
Transporting raw materials or product quantity between 3 manufacturer of table
P18 D44
S27 3200 ---
S35 384376 ---
P18 --- 387576
The lorry quantity of transporting raw materials or product between 4 manufacturer of table
P18 D44
S27 4 ---
S35 481 ---
P18 --- 776
(25-1) can be enumerated by this 15 manufacturers3=29791 candidate solutions, wherein infeasible by deleting 4561 Xie Hou, remaining 25230 candidate solutions, successively calculates the objective function approximation of each candidate solution, obtains objective function approximation The smallest manufacturer's group is combined into S27S35P18D44, carries out model solution again to the supply chain, and obtaining target function value is 4441113.S27S35P18D47 is combined into using optimal manufacturer's group that CPLEX optimization software obtains, target function value is 4425888, it can be seen that the accuracy rate for choosing optimal manufacturer is 75%, and relative error is about 0.34%.
It is provided with ten groups of experiments in feasibility the present embodiment in order to verify this method, is compared with CPLEX optimization software, Each alternative Number of firms is linearly increasing, and every group of experiment generates 3 test cases at random, has recorded optimal solution, approximate solution, phase respectively To error and problem solving time.Executing the time is more than 30 minutes, is considered as calculating time-out.Test result is as shown in table 5:
5 test result of table
The test case below of problem scale 50/50/50/50 known to above-mentioned experimental data, relative error do not surpass 1% is crossed, the test case that problem scale is 60/60/60/60 to 70/70/70/70, relative error is no more than 2%.It can see Out, for relative error with the increase of problem scale, error has certain increase tendency, but increasess slowly, in acceptable range Within;
CPLEX optimization software has certain advantage when solving small-scale problem, but when problem scale reaches 70/70/70/ When 70, the calculating time is sharply increased, and the solution of problem can not be obtained within the acceptable time.And this method can be solved and be asked Topic scale solves the time at 10 minutes or so to 100/100/100/100, when problem scale reach 70/70/70/70 with Under test case, runing time is no more than 3 minutes.Problem scale is more than 70/70/70/70, runing time increasing degree Superiority more gentle, which reflects it on Large-scale Optimization Problems has good degree of approximation and solving speed.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations;Although Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used To modify to technical solution documented by previous embodiment, or some or all of the technical features are equal Replacement;And these are modified or replaceed, the scope of the claims in the present invention that it does not separate the essence of the corresponding technical solution.

Claims (6)

1. a kind of method for solving greening supply chain collaborative design problem, characterized by the following steps:
Step 1: the quantity of product or raw material being converted into corresponding means of transport quantity, is made with cost, carbon emission, water consumption For optimization aim, the supply chain mathematical model of the quaternary structure of integrated manufacturer's selection and Transportation Planning is established;The mathematical model Including objective function and qualifications, the formula of the objective function is as follows:
Wherein, i represents vendor number, i ∈ I;J represents manufacturer's number, j ∈ J;K represents retail trader's number, k ∈ K;L is represented Customer number, l ∈ L;M represents raw material number, m ∈ M;N representative products number, n ∈ N;CSMimIt represents from supplier i buying one The cost of unit raw material m;CPPjnRepresent the cost that manufacturer j produces a unit product n;ESMimRepresent supplier i production one Carbon emission amount caused by unit raw material m;EPPjnIt represents manufacturer j and produces carbon emission amount caused by a unit product n; WSMimIt represents supplier i and produces water consumed by a unit raw material m;WPPjnIt represents manufacturer j and produces a unit product n Consumed water;DSPijRepresent the distance between supplier i and manufacturer j;DPDjkIt represents between manufacturer j and retail trader k Distance;DDCklRepresent the distance between retail trader k and client l;CMPjRepresent operation cost in manufacturer's j period;CMDkGeneration Operation cost in the table retail trader k period;CTsp represents the cost of 1 kilometer of Freight Transport;ETsp represents a Freight Transport 1 Carbon emission caused by kilometer;A, b respectively represent conversion weight when carbon emission, water consumption to be converted to cost;spjExpression is No to select manufacturer j as supply chain cooperation manufacturer, 1 represents selection, and 0 representative does not select;sdkIndicate whether selective distribution quotient k Selection is represented as supply chain cooperation manufacturer, 1,0 representative does not select;aspmijmIt transports from supplier i to the raw material of manufacturer j The quantity of m;apdpjknIt transports from manufacturer j to the quantity of the product n of retail trader k;aSPijFrom supplier's i transporting raw materials to life The lorry quantity of business men j;aPDjkThe lorry quantity of product to retail trader k is transported from manufacturer j;aDCklIt transports and produces from retail trader k Product to client l lorry quantity;
The qualifications include precondition and constraint condition;
The precondition are as follows: the order of all clients must all meet;Supplier constrains with the supply upper limit, manufacturer With production upper limit constraint, retail trader has storage upper limit constraint;Each manufacturer, operation cost is fixed in retail trader's period;No Same raw material or product can be merged into same lorry;
The constraint condition are as follows:
Constraint between lorry quantity and raw material, product quantity:
Wherein,ATMmThe maximum number of raw material m can be delivered by representing a lorry Amount;ATPnThe maximum quantity of product n can be delivered by representing a lorry;adcpklnRepresentative is transported from retail trader k to the production of client l The quantity of product n;
The order demand of client must satisfy constraint:
Wherein,DlnRepresent the order total amount of client's l ordering products n;
Retail trader inventory constraint:
Wherein,UBStockknRetail trader k is represented to the maximum inventory of product n;
Manufacturer produces force constraint:
Wherein,UBPPjnManufacturer j is represented to the largest production quantity of product n;
Supplier is for stress constraint:
WhereinUBSMimRepresent the maximum quantity for the raw material m that supplier i can be provided;
Retail trader's amount of stocking up, shipment amount are consistent:
Wherein,
Materials procurement quantity and production quantity keep proportion consistent:
i∈Iaspmijm=MPRmn×∑k∈Kapdpjkn (10)
Wherein,MPRmnRepresent the quantitative relation ratio between raw material m and product n;
Nonnegative integer and binary system constraint:
spj∈{0,1} (17)
sdk∈{0,1} (18)
Wherein,
Step 2: the transport between optimal supply chain network structure and the structure every two vertex is obtained according to compound out of kilter method Amount, obtains totle drilling cost according to objective function;
The compound out of kilter method is to carry out synthesis by the alternative manufacturer to supply quotient sheaf, raw vendor level and distributor level to comment Estimate, obtains the manufacturer with preferably assessment score;The manufacturer includes supply quotient sheaf, production quotient sheaf, distributor level;Enumerate by The all possible combinations that these manufacturers are constituted delete the candidate solution for not being able to satisfy customer order wherein as candidate disaggregation;And it is right Remaining each candidate solution calculating target function approximation, the smallest candidate solution of selection target function approximation is as final supply Chain network structure reapplies branch and bound method to calculate the freight volume between every two vertex, freight volume is brought into target letter Totle drilling cost is acquired in number.
2. a kind of method for solving greening supply chain collaborative design problem according to claim 1, it is characterised in that: described Specific step is as follows for step 2:
Step 2.1: the high supply quotient set S of comprehensive score, production quotient set P, distribution quotient set are obtained according to partner's out of kilter method Close D;
Partner's out of kilter method is assessment score to be calculated for candidate manufacturer, and obtain the comprehensive of each candidate manufacturer using weighting adduction Close scoring;Using the top k algorithm based on quicksort, select respectively the high preceding η supplier of comprehensive score, raw manufacturer and Retail trader obtains supply quotient set S, production quotient set P, distribution quotient set D;
Step 2.2: candidate disaggregation CS is obtained according to candidate solution enumeration;
The candidate solution enumeration be preferentially after supply quotient set S, production quotient set P, distribution quotient set D and client set C;It finds out respectively and is made of set S ', P ', D ' all subsets in addition to empty set of S, P, D, the set C ' that the complete or collected works of C are constituted, then All candidate solutions of GSCND are obtained by the orderly cartesian product of S ', P ', D ', C ';
Step 2.3: infeasible candidate solution is deleted according to infeasible solution deletion algorithm;
The infeasible solution deletion algorithm is to be directed to supply quotient sheaf, production quotient sheaf, distributor level respectively according to precondition to carry out Judgement, if this layer of manufacturer's ability is not able to satisfy all customer order demands, the candidate solution be it is invalid, it is invalid to delete this Solution;The input data of the algorithm is S ', P ', D ', and output data is S ", P ", D ", the S ", P ", D " respectively indicates deletion can not Supply quotient set, production quotient set, distribution quotient set after row solution;
Step 2.4: the filter algorithm based on objective function approximation obtains the totle drilling cost of supply chain network;
The filter algorithm based on objective function approximation is the filtered residue candidate solution according to obtained in step 2.3, To each candidate solution calculating target function approximation, selection target function approximation is the smallest to be deconstructed into final supply chains system Network;It reapplies branch and bound method and obtains the freight volume between adjacent two layers vertex, freight volume is brought into and is acquired in objective function Totle drilling cost.
3. a kind of method for solving greening supply chain collaborative design problem according to claim 3, it is characterised in that: described Specific step is as follows for step 2.1:
Step 2.1.1: evaluation index when listing supplier, manufacturer, retail trader respectively preferentially;To each index, according to it Shared specific gravity is different in the value of objective function, assigns different weights;
Step 2.1.1.1: the vendors' evaluating index includes that each cost of raw, each raw material carbon emission are corresponding Cost, the corresponding cost of each raw material water consumption are transported from supplier to the cost of manufacturer;The specific method is as follows:
Enable PNnIndicate the order total amount of product n, MNmRepresent the total demand of raw material m;Formula is as follows:
Each cost of raw:
(∑i∈ICSMim/|I|)×MNm (21)
The corresponding cost of each raw material carbon emission:
a×(∑i∈IESMim/|I|)×MNm (22)
The corresponding cost of each raw material water consumption:
a×(∑i∈IWSMim/|I|)×MNm (23)
It transports from supplier to the cost of manufacturer:
Select a kind of cost of raw material as with reference to cost, weight is set as 1;The weight of other indices is according to its correspondence The ratio of cost and reference cost determines;
The weight for enabling the first cost of raw material is 1, i.e. m=1;The cost weight WSC of raw material mm, raw material m carbon emission power Weight WSEm, raw material m water consumption weight WSWm, it is as follows with the calculation formula of manufacturer's distance weighting WSP:
Step 2.1.1.2: the evaluation index of the manufacturer includes the cost of each production of manufacturer, each production carbon row Put corresponding cost, the corresponding cost of each production water consumption, operation cost, from supplier transport to manufacturer's cost, from Manufacturer transports to retail trader's cost;
Take each index average value, calculate separately its from supplier's transporting raw materials to manufacturer, production product and transport product to Cost caused by retail trader's stage;The weight for enabling one of production cost is 1, and the weight of other indexs is right according to its Cost is answered to determine with the ratio referring to cost;
The cost of each production:
(∑j∈JCPPjn/|J|)×PNn (29)
The corresponding cost of each production carbon emission:
a×(∑j∈JEPPjn/|J|)×PNn (30)
The corresponding cost of each production water consumption:
b×(∑j∈JWPPjn/|J|)×PNn (31)
Operation cost:
It transports from supplier to manufacturer's cost:
It transports from manufacturer to retail trader's cost:
The weight for enabling the first production cost is 1, i.e. n=1;The production cost weight WPC of product nn, product n production carbon Discharge weight WPEn, product n production water consumption weight WPWn, operation cost weight WPM, with supplier's distance weighting WPS, with The calculation formula of retail trader distance weighting WPD is as follows:
Step 2.1.1.3: the evaluation index of retail trader include: operation cost, the cost transported from manufacturer to retail trader, from point Pin quotient transports to the cost of client;
Take each index average value, calculate separately its from manufacturer transport product to retail trader again to caused by client's stage at This, is averaged and is calculated;The weight for enabling operation cost is 1, the weights of other indexs according to its corresponding cost and referring at This ratio determines;
Operation cost:
It transports from manufacturer to the cost of retail trader:
It transports from retail trader to the cost of client:
Enabling the weight WDM of operation cost is 1, such as with manufacturer's distance weighting WDP, with the calculation formula of client's distance weighting WDC Under:
WDM=1 (44)
Step 2.1.2: comprehensive score is carried out to manufacturer respectively;
Each evaluation index same level manufacturer is compared respectively, with 0-1 matrix storage comparative result, ranks indicate factory Quotient, matrix element indicate that row whether better than column, is that element value takes 1, otherwise takes 0;According still further to the weight of each index, to 0-1 square Battle array is weighted addition, obtains score matrix, sums to the matrix by rows, obtains the comprehensive score of the manufacturer;Specific steps are such as Under:
Step 2.1.2.1: the comprehensive score of supplier;
Each cost of raw material compares matrix:
Am=[αoq]I×I (47)
Wherein, αoqRepresent matrix AmIn element;o,q∈I,CSMomRepresent from supplier o purchase a unit raw material m at This;CSMqmRepresent the cost that a unit raw material m is purchased from supplier q;
Each raw material carbon emission compares matrix:
Bm=[βoq]I×I (48)
Wherein, βoqRepresent matrix BmIn element;ESMomIt represents supplier o and produces carbon emission caused by a unit raw material m Amount;ESMqmIt represents supplier q and produces carbon emission amount caused by a unit raw material m;
Each raw material water consumption compares matrix:
Qm=[ρoq]I×I (49)
Wherein, ρoqMatrix QmIn element;WSMomIt represents supplier o and produces water consumed by a unit raw material m;WSMqmGeneration Table supplier q produces water consumed by a unit raw material m;
With each manufacturer's distance versus matrix:
Wj=[μoq]I×I (50)
Wherein, μoqRepresent matrix WjIn element;DSPojRepresent the distance between supplier o and manufacturer j;DSPqjRepresent supply The distance between quotient o and manufacturer j;
Addition is weighted according to the weight being calculated in step 2.1.1.1 to above-mentioned comparison matrix, obtains supplier two-by-two Between Comparison score matrix:
The comprehensive score formula of supplier is obtained by row summation to matrix T1 again:
The comprehensive score set TS1 of all suppliers is obtained by above-mentioned formula;
Step 2.1.2.2: the comprehensive score of manufacturer;
Each production Cost comparisons matrix:
En=[euv]|J|×|J| (53)
Wherein,uvRepresent matrix EnIn element;u,v∈J;CPPunRepresent the cost that manufacturer u produces a unit product n;CPPvn Represent the cost that manufacturer v produces a unit product n;
Each production carbon emission compares matrix:
Fn=[fuv]|J|×|J| (54)
Wherein, fuvRepresent matrix FnIn element;EPPunIt represents manufacturer u and produces carbon emission amount caused by a unit product n; EPPvnIt represents manufacturer v and produces carbon emission amount caused by a unit product n;
Each production water consumption compares matrix:
Gn=[guv]|J|×|J| (55)
Wherein, guvRepresent matrix GnIn element;WPPunIt represents manufacturer u and produces water consumed by a unit product n;WPPvn It represents manufacturer v and produces water consumed by a unit product n;
Operation cost compares matrix:
H=[huv]|J|×|J| (56)
Wherein, huvRepresent the element in matrix H;CMPuRepresent operation cost in manufacturer's u period;CMPvRepresent manufacturer's v period Interior operation cost;
With the set S distance versus matrix of supplier:
Oi'=[δuv]|J|×|J| (57)
Wherein, δuvRepresent matrix Oi′In element;S represents the set of the supplier obtained using top k algorithm;I '=1, 2,…,η;DSPi′uRepresent the distance between supplier i ' and manufacturer u;DSPi′vIt represents between supplier i ' and manufacturer v Distance;
With each retail trader's distance versus matrix:
Uk=[εuv]|J|×|J| (58)
Wherein, εuvRepresent matrix UkIn element;DPDukThe distance between manufacturer u and retail trader k;DPDvkManufacturer v with point Sell the distance between quotient k;
Addition is weighted according to the weight being calculated in step 2.1.1.2 to above-mentioned comparison matrix, obtains manufacturer two-by-two Between Comparison score matrix:
The comprehensive score formula of manufacturer is obtained by row summation to matrix T2 again:
The comprehensive score set TS2 of all manufacturers is obtained by above-mentioned formula;
Step 2.1.2.3: the comprehensive score of retail trader;
Operation cost compares matrix:
L '=[θwy]|K|×|K| (61)
Wherein, θwyRepresent matrix L ' in element;w,y∈K;CMDwRepresent operation cost in the retail trader w period;CMDyIt represents and divides Sell operation cost in the quotient y period;
With the set P distance versus matrix of manufacturer:
Wherein, xwyRepresent matrix Xj′In element;P represents the production quotient set obtained using top k algorithm;J '=1,2 ..., η;DPDj′wRepresent the distance between manufacturer j ' and retail trader w;DPDj′yRepresent the distance between manufacturer j ' and retail trader y;
With each client's distance versus matrix:
Vl=[zwy]|K|×|K| (63)
Wherein, zwyRepresent matrix VlIn element;DDCwlRepresent the distance between retail trader w and client l;DDCylRepresent retail trader The distance between y and client l;
Addition is weighted according to the weight being calculated in step 2.1.1.3 to above-mentioned comparison matrix, obtains retail trader two-by-two Between Comparison score matrix:
The comprehensive score formula of retail trader is obtained by row summation to matrix T3 again:
The comprehensive score set TS3 of all retail traders is obtained by above-mentioned formula;
Step 2.1.3: the comprehensive score obtained according to step 2.1.2, the top k algorithm based on quicksort obtain comprehensive score High preceding η supply quotient set S, production quotient set P, distribution quotient set D;Specific step is as follows:
Step 2.1.3.1: a base value is found in supplier comprehensive score set TS1;The base value is chosen in array The value of the last one element;
Step 2.1.3.2: element bigger than base value in the set is placed in its left side by subregion, and the element smaller than base value is set In its right side;
Step 2.1.3.3: judging left siding-to-siding block length, is such as equal to η, program determination, η element before exporting;As left siding-to-siding block length is big In η, then step 2.3.1.1 and step 2.3.1.2 is repeated to left section, until program determination;If left siding-to-siding block length is less than η, then Step 2.3.1.1 and step 2.3.1.2 is repeated to right section, until program determination;
Step 2.1.3.4: the η element that step 2.1.3.3 is exported is denoted as supply quotient set S;
Step 2.1.3.5: a base value is found in manufacturer's comprehensive score set TS2;Execute step 2.1.3.2 and step 2.1.3.3, η element before exporting is denoted as production quotient set P;
Step 2.1.3.6: a base value is found in retail trader comprehensive score set TS3;Execute step 2.1.3.2 and step 2.1.3.3, η element before exporting is denoted as distribution quotient set D.
4. a kind of method for solving greening supply chain collaborative design problem according to claim 3 or 4, it is characterised in that: Specific step is as follows for the step 2.2:
Step 2.2.1: construction setC '={ C }, wherein 2S、 2P、2DThe respectively power set of set S, P, D;
Step 2.2.2: obtaining set S ', P ', D ' according to bit arithmetic, wherein | S ' |=2I- 1, | P ' |=2J- 1, | D ' |=2K-1, | C ' |=1, to obtain candidate disaggregation CS:
CS=(2I-1)×(2J-1)×(2K-1) (66)。
5. a kind of method for solving greening supply chain collaborative design problem according to claim 5, it is characterised in that: described Specific step is as follows for step 2.3:
Step 2.3.1: supply quotient sheaf: for the supplier S in S 'iIf Then by SiIt is added to set S ";
Step 2.3.2: production quotient sheaf: for the manufacturer P in P 'iIfThen by PiAdd It is added to set P ";
Step 2.3.3: distributor level: for the manufacturer D in D 'iIfThen will DiIt is added to set D ".
6. a kind of method for solving greening supply chain collaborative design problem according to claim 6, it is characterised in that: described The specific steps of objective function approximation are solved in step 2.4 are as follows:
The cost CSM of each raw material of supplier in remaining candidate solutionm, carbon emission ESMm, water consumption WSMmCalculation formula it is as follows:
The cost CPP of each production of manufacturer in remaining candidate solutionn, carbon emission EPPn, water consumption WPPnCalculation formula such as Under:
Distance Dis, the Dis in remaining candidate solution between manufacturer include supplier transport to manufacturer, manufacturer transport to point Pin quotient, retail trader transport to lorry quantity TSP, TPD, TDC of client, and calculation formula is as follows:
Objective function approximation ObjapprFormula are as follows:
CN201811336950.6A 2018-11-12 2018-11-12 A method of solving greening supply chain collaborative design problem Pending CN109492810A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811336950.6A CN109492810A (en) 2018-11-12 2018-11-12 A method of solving greening supply chain collaborative design problem

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811336950.6A CN109492810A (en) 2018-11-12 2018-11-12 A method of solving greening supply chain collaborative design problem

Publications (1)

Publication Number Publication Date
CN109492810A true CN109492810A (en) 2019-03-19

Family

ID=65694244

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811336950.6A Pending CN109492810A (en) 2018-11-12 2018-11-12 A method of solving greening supply chain collaborative design problem

Country Status (1)

Country Link
CN (1) CN109492810A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110956320A (en) * 2019-11-26 2020-04-03 辽宁工程技术大学 Sustainable supply chain addressing and distributing method based on dynamic relaxation intelligent algorithm
CN112150058A (en) * 2019-06-26 2020-12-29 株式会社日立制作所 Supply chain design system and supply chain design method
CN112801810A (en) * 2021-02-25 2021-05-14 辽宁工程技术大学 Sustainable supply chain design method based on graph network
CN112862375A (en) * 2021-04-02 2021-05-28 中国科学技术大学 System for solving green supply chain collaborative design problem
CN116562571A (en) * 2023-05-12 2023-08-08 哈尔滨商业大学 Supply chain management method and system based on block chain
CN116562571B (en) * 2023-05-12 2024-05-14 哈尔滨商业大学 Supply chain management method and system based on block chain

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112150058A (en) * 2019-06-26 2020-12-29 株式会社日立制作所 Supply chain design system and supply chain design method
CN110956320A (en) * 2019-11-26 2020-04-03 辽宁工程技术大学 Sustainable supply chain addressing and distributing method based on dynamic relaxation intelligent algorithm
CN110956320B (en) * 2019-11-26 2023-05-23 辽宁工程技术大学 Address selecting and distributing method of sustainable supply chain based on dynamic relaxation intelligent algorithm
CN112801810A (en) * 2021-02-25 2021-05-14 辽宁工程技术大学 Sustainable supply chain design method based on graph network
CN112801810B (en) * 2021-02-25 2024-03-29 辽宁工程技术大学 Sustainable supply chain design method based on graph network
CN112862375A (en) * 2021-04-02 2021-05-28 中国科学技术大学 System for solving green supply chain collaborative design problem
CN116562571A (en) * 2023-05-12 2023-08-08 哈尔滨商业大学 Supply chain management method and system based on block chain
CN116562571B (en) * 2023-05-12 2024-05-14 哈尔滨商业大学 Supply chain management method and system based on block chain

Similar Documents

Publication Publication Date Title
CN109492810A (en) A method of solving greening supply chain collaborative design problem
Hiassat et al. A genetic algorithm approach for location-inventory-routing problem with perishable products
Izadikhah et al. Ranking sustainable suppliers by context-dependent data envelopment analysis
Mansoornejad et al. Scenario-based strategic supply chain design and analysis for the forest biorefinery using an operational supply chain model
Yu et al. Nash game model for optimizing market strategies, configuration of platform products in a Vendor Managed Inventory (VMI) supply chain for a product family
Ramezani et al. Closed-loop supply chain network design under a fuzzy environment
Min et al. The dynamic design of a reverse logistics network from the perspective of third-party logistics service providers
Wang et al. Location and allocation decisions in a two-echelon supply chain with stochastic demand–A genetic-algorithm based solution
Jiao et al. A heuristic genetic algorithm for product portfolio planning
Tahirov et al. Optimization of closed-loop supply chain of multi-items with returned subassemblies
Karimi et al. Multi-objective multi-facility green manufacturing closed-loop supply chain under uncertain environment
Elahi et al. A fuzzy compromise programming solution for supplier selection in quantity discounts situation
Khalifehzadeh et al. Two effective metaheuristic algorithms for solving a stochastic optimization model of a multi-echelon supply chain
Sadeghi A multi-item integrated inventory model with different replenishment frequencies of retailers in a two-echelon supply chain management: a tuned-parameters hybrid meta-heuristic
Limpianchob Integrated of harvesting and production planning in aromatic coconut supply chain using mixed-integer linear programming
CN202771470U (en) Computer system used for dock performance analysis
Deb et al. A genetic algorithm based heuristic optimization technique for solving balanced allocation problem involving overall shipping cost minimization with restriction to the number of serving units as well as customer hubs
Poorbagheri et al. Vendor managed inventory of a single-vendor multiple-retailer single-warehouse supply chain under stochastic demands
Rajesh et al. Simulated annealing algorithm for balanced allocation problem
Wu et al. Regression and extrapolation guided optimization for production–distribution with ship–buy–exchange options
Khakbaz et al. A multicriteria decision model for supplier selection in portfolios with interactions
D’Amours et al. Pulp and paper supply chain management
CN114066515A (en) Method and device for determining purchasing strategy and computer readable storage medium
Singh et al. TISM-based model to evaluate the flexibility index of a supply chain
US7979304B2 (en) Method of mapping dynamic market conditions to global manufacturing site analysis

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20190319