17
Interna Closed Mehrdad Mehrdad M University Alireza Ras University Amir H. Sar KEYWOR Closed loop Binary prog vehicle rou simultaneo and deliver In today's w industrial Correspondin * Email: rashidi@ Received 13 D 20 December 2 Internationa ational Jour Loop Su d Mirzaba Mirzabaghi, M shidi Komijan rfaraz, Assista RDS p supply cha gramming, uting, us pick-up ry 1. Intro world, the ch spheres are ng author: Alire @azad.ac.ir December 2015; r 2016 al Journal of Ind nal of Indus upply Ch aghi, Alirez M.Eng. studen n, Associate P ant Prof., Col A ain, I t w h f t a m f n / c d a e s w a b t t s r © R oduction1 hanges in the occurring eza Rashidi Komi revised 10 Febru dustrial Engineer strial Engin Septemb htt hain Pla za Rashid nt, College o Prof., Departm llege of Indust ABSTRACT In the recen to economic well as envi hand, many forward an transport ac a logistic sy mixed intege forward / re network use /reverse log common fac disposal fac and multi-p each level. V such as mu with simulta and split d between the throughout total cost. N shows that reasonable t © 2016 IU Reserved e economic a more quick ijan uary 2016; accep ring & Producti eering & Pr ber 2016, Volum pp. 287- 3 tp://IJIEPR. anning W i Komijan of Industrial ment of Indust trial Engineer T nt decade, sp c benefits of ironmental l y studies c nd reverse ctivities are ystem, and it er linear pr everse suppl ed in this p gistic networ cilities of pro cilities and c product with Various type ulti-period r aneous deliv delivery. Th e various f the plannin Numerical e the propose time for sma UST Public nd kly pted th ha go re co in an pa ion Research, Se roduction Re me 27, Numbe 303 .iust.ac.ir/ With Veh n * & Amir Engineering, trial Engineer ring, Tehran S pecial attent f recovery a legislation a laim that s logistic c also one of t needs an a rogramming ly chain as paper is a rk, which is oduction/rec customers. T h the ability es of vehicle routing, mu very and pi he model r facilities in ng horizon w example for ed model co all and medi ation, IJIE han in the pa as increased oods at a low espond to ompetitive ncreasingly e nd integrated arallel to th eptember 2016, V esearch (201 er 3 hicle Rou H. Sarfara Tehran Sou ring, Firoozko South Branch, tion is paid and recyclin and social c separate, se causes sub the most im accurate pla g model is p well as veh multi-echelo comprised covery and The proposed y to conside e routing mo ulti-depot, m ick-up, flexi results pres forward a with the obj r solving th ould reach t ium real-wo EPR. Vol. ast. Compet d, and costum wer price and this requ advantage established d logistics. O ese developm Vol. 27, No. 3 16) uting az uth Branch, I ooh Branch, I Islamic Azad to reverse l ng of used p concerns. O equential p b-optimality. mportant com anning. In th roposed for hicles routin on integrate of capacitat distribution d model is m er several f odels are als multi-produc ible depot a ent the pro and reverse jective minim he model us the optimal orld problem 27, No.3, A ition among mers want h d low delive uest and m , compan supply chai On the othe ments in the Islamic Azad Islamic Azad d University logistic due products as n the other planning of . Effective mponents of his study, a r integrated ng. Logistic ed forward ted facility, /collection, multi-period facilities in so included cts, routing assignment, oduct flow directions mization of sing GAMS solution in ms. All Rights g companies high quality ery time. To maintaining nies have n networks er hand and e economic

Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

  • Upload
    others

  • View
    0

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Interna

Closed

Mehrdad

Mehrdad MUniversity Alireza RasUniversity Amir H. Sar KEYWORClosed loopBinary progvehicle rousimultaneoand deliver

In today's windustrial

Correspondin*

Email: rashidi@Received 13 D20 December 2

Internationa

ational Jour

Loop Su

d Mirzaba

Mirzabaghi, M

shidi Komijan

rfaraz, Assista

RDS p supply chagramming,

uting, us pick-up ry

1. Introworld, the chspheres are

ng author: Alire

[email protected] December 2015; r2016

al Journal of Ind

nal of Indus

upply Ch

aghi, Alirez

M.Eng. studen

n, Associate P

ant Prof., Col

Aain,

Itwhftamfn/cdaeswabttsr

©R

oduction1 hanges in the

occurring

eza Rashidi Komij

revised 10 Febru

dustrial Engineer

strial Engin

Septemb

htt

hain Pla

za Rashid

nt, College o

Prof., Departm

llege of Indust

ABSTRACT

In the recento economicwell as envihand, manyforward antransport aca logistic symixed integeforward / renetwork use/reverse logcommon facdisposal facand multi-peach level. Vsuch as muwith simultaand split dbetween thethroughout total cost. Nshows that reasonable t

© 2016 IUReserved

e economic amore quick

ijan

uary 2016; accep

ring & Producti

eering & Pr

ber 2016, Volumpp. 287- 3

tp://IJIEPR.

anning W

i Komijan

of Industrial

ment of Indust

trial Engineer

T

nt decade, spc benefits ofironmental ly studies cnd reverse ctivities are ystem, and iter linear preverse suppled in this p

gistic networcilities of procilities and cproduct withVarious typeulti-period raneous delivdelivery. The various fthe planninNumerical ethe proposetime for sma

UST Public

nd kly

pted

thhagorecoinanpa

ion Research, Se

roduction Re

me 27, Numbe303

.iust.ac.ir/

With Veh

n*& Amir

Engineering,

trial Engineer

ring, Tehran S

pecial attentf recovery alegislation alaim that s

logistic calso one of t needs an a

rogrammingly chain as paper is a rk, which is oduction/rec

customers. Th the abilityes of vehiclerouting, muvery and pi

he model rfacilities in ng horizon wexample fored model coall and medi

ation, IJIE

han in the paas increasedoods at a lowespond to ompetitive ncreasingly end integratedarallel to th

eptember 2016, V

esearch (201

er 3

hicle Rou

H. Sarfara

Tehran Sou

ring, Firoozko

South Branch,

tion is paid and recyclinand social cseparate, secauses sub

f the most impaccurate pla

g model is pwell as vehmulti-echelocomprised

covery and The proposedy to considee routing moulti-depot, mick-up, flexiresults pres

forward awith the objr solving thould reach tium real-wo

EPR. Vol.

ast. Competd, and costumwer price and

this requadvantage

established d logistics. Oese developm

Vol. 27, No. 3

16)

uting

az

uth Branch, I

ooh Branch, I

Islamic Azad

to reverse lng of used pconcerns. Oequential pb-optimality.

mportant comanning. In throposed for

hicles routinon integrateof capacitatdistributiond model is mer several fodels are alsmulti-producible depot aent the pro

and reverse jective minimhe model usthe optimal orld problem

27, No.3, A

ition amongmers want hd low delive

uest and m, compansupply chaiOn the othements in the

Islamic Azad

Islamic Azad

d University

logistic due products as n the other

planning of . Effective

mponents of his study, a r integrated ng. Logistic ed forward ted facility, /collection,

multi-period facilities in so included cts, routing assignment, oduct flow

directions mization of sing GAMS solution in

ms.

All Rights

g companies high quality ery time. To maintaining

nies have n networks

er hand and e economic

f

f

f

Page 2: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

288 M. H. S

sphere, becproducts, inof customattention tohas increaslegislationsresponsibillife cycle point of vproducts isproducts, service resway, it incompany. been done used produimportant Kodak, Xerefurbishin In the litreverse loglogistics, in(i.e., consuproducts) manage endecisions sto secondcustomers)materials), markets throf some haMany studseparate orreverse lAccording forward anconsiderablthe integrreverses losupply chasignificant loop suppSupply of raw materiadistributioncostumers CLSC in returned premanufactway that isform of CL

Mirzabaghi, Sarfaraz

Internationa

cause of envncreasing en

mers and eno the reverssed. In somes force ity for theirof the prod

view, recoves profitable f

establishmesults in custndirectly leIn recent yon the econ

ucts [1]. In thcompanies, erox, have

ng and repairi

terature, difgistics’ procen general foumers) wherare collecte

nd of life puch as reman

d markets , recycling

repairing rough repairi

azardous matdies in ther sequential ogistics reto these stu

nd reverse le savings in

rated systemogistics, whain (CLSC)

importance ly chain inraw materiaals into finisn of finishethrough thereverse flow

products froturing, recycs appropriateLSC.

A. Rashidi K

al Journal of Ind

vironmental invironmental nvironmentae logistics (e countries,

companiesr products oducts. From ry and recy

for the compnt of aftetomer satisfaads to moryears, manynomic benefithe past three

such as Gepaid speciaing of the ret

fferent clasesses are presorms, start frre used proded and thenproducts thronufacturing (or if poss(to convert (to sell in

ing), and finerials. e literature

planning ofesult in sudies, integralogistics co

n costs [2]. Inm includes hich is calle

that has re[3]. Typica

n forward als from suphed productsed products e distributionw includes om final coling or dispo

e. Fig. 1 show

Komijan*& A

dustrial Engineer

impact of usconsciousne

al legislation(RL) networenvironment

s to taover the enti

an economycling of usanies. In som

er-sales repafaction; in thre profits f studies hats of recyclidecades, maneneral Motoal attention turn products

ssifications sented. rever

from end useducts (returnn attempts ough differe(to resale thesible to fir

them to ran the secoally, disposi

showed thf forward asub-optimalitated design

ourses lead n the literatur

forward aed closed-loecently gainally, a closeflow includpliers, conves in plants, a

to the finn centers. Tcollecting t

onsumers aosing them inws the gener

A. C

ring & Producti

sed ess ns, rks tal

ake ire

mic sed me air his for ave ng ny rs, to

s.

of rse ers

ned to

ent em rst aw nd ng

hat nd ty. of to re, nd op

ned ed-des ert nd nal

The the nd n a ric

OsuinW20coacadefmsyreacprprroandiinTrinCcoDfoAbedisuinacreHcotrefmdiInopm

Closed Loop Su

ion Research, SE

Fig. 1. T

One of the upply chain nventory

Wajszczuk [40%-30% of ompanies. Tctivities candvantage forffective tran

most importaystem, and everse logisctivities limroducts recroducts shououte with thnd distributirection is on the supply cransportation

nto two typesCollection oostumers and

Distribution oorward flow.

An important etween twoirections. Inuitable approntegration ctivities resueturned prod

Hence, an oncerns finansfer the fficiently by

models such aistribution plnventory mperational de

main tools to

upply Chain P

Eptember 2016, V

The generi

most imporis logistic

and tran4] showed th

the total cherefore, ann create sur companies.sportation acant componit needs anstics, non-e

mit the econcovery. Co

uld be done ahe lowest cotion of prone of the mchain managn activities s: of returned d move in theof refurbishe

issue in CLSo different

n this case, oach to costof distribuults in the

ducts on the important

nding optimproducts

y implementas vehicle rolanning.

management ecision that o improve r

Planning Wit

Vol. 27, No. 3

c form of C

rtant activitiactivities thsportation

hat the logistcosts of ma

ny optimizatiustainable . As mentioctivities are

nents of ean accurate peffective tranomic succollection ofat the right tiost. Also, traoducts in th

most importangement.

in CLSC a

products e reverse flowed and new

SC is creatinflows in

integrating t savings. Foution and

vehicles wway back to

operationalmal vehicle

through thtation of mouting mode

is another is known asesponsivenes

th Vehicle …

CLSC

es of each hat includes

activities. tic costs are anufacturing ion in these competitive

oned earlier, one of the

ach logistic planning. In ansportation ess of the f returned me and in a ansportation he forward nt problems

are divided

from final w. products in

ng synergies n different

flow is a or example,

collection with full of o the depot. l decision

routes to he network mathematical els in CLSC

important s one of the ss at lower

Page 3: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

cost, reduccustomer seThis paper brief discupresented; mathematicSection 3. computatioIn Sectionoffered.

2-1. ClosedAccording Executive C‘‘The proccontrollingraw matergoods and consumptioof recapturA review literature shin the fieldfrom suppsmaller pareverse loglogistics litespecially objective innumber acollection disposal ccapacity aPishvaee etto design areverse logcollection ccenters wiearlier, sepand reversThe configincluding lbetween componentintegrated reverse logcosts ([2],[of many onumber, loas plants, recovery, dthe optimaland reversproposed a

p Supply Cha

Internationa

cing inventoervice. is organized

ussion about the probl

cal formulaThe generat

onal results an 5, some

2. Literad-loop suppl

to the AmCouncil, revcess of plan the efficierials, in-prorelated info

on to the poinring value or

of the suhows that a d of forward

plier to finaart of the litgistics [3]. terature showafter 2005, n RL netwo

and locationcenters, rem

centers, as and the optt al. [8] propa single pro

gistics networcenters, recoith limited

parate or sequse logistics guration of location of f

them, ints. Some studplanning an

gistics reduc[9],[10],[11])of these pa

ocation, and distribution

disposal centl products flose directiona MILP mod

ain Planning W

al Journal of Ind

ory costs, a

d as follows: previous re

em descripation are tion of data are presented

concluding

ature reviewly chain ma

merican Revverse logisticnning, implent, cost-effe

ocess inventormation fromnt of origin fr proper dispupply chainlarge part of

d logistics nal costumersterature is inA review o

ws that studieare increas

ork design isn of facilimanufacturin

well as detimal flow posed a MILduct and murk consisting

overy centerscapacities. A

uential plannresults in sreverse logi

facilities andnfluences dies in this fnd design ofces the total). In genera

apers is to capacity of

n centers alters, as well aow among thn. Jayarmandel to design

With Vehicle

dustrial Enginee

and improvi

in Section 2lated works

ption and comprised instances a

d in Section remarks a

w nagement erse Logistis is defined ementing, aective flow tory, finishm the point for the purpoposal’’([5],[6n managemef the studies

network desis; a relativen the field of the reveres in this fielsing [7]. Mas to define tities such ng centers aetermine theamong them

LP formulatiultiple-echelg of costumes, and disposAs mention

ning of forwasub-optimalitistics networ

d material floall netwo

field show thf forward al supply chaal, the purpodetermine tfacilities, sulso collectioas determini

hem in forwan et al. [1n an integrat

……

ering & Producti

ng

, a is

its in nd 4.

are

ics as nd of

hed of

ose 6]). ent

is gn ely of

rse ld, ain the as nd eir m. on on rs, sal

ned ard ty. rk, ow ork hat nd ain ose the uch on, ng

ard 12] ted

focuSeCondeneinecreAfocofaorcocompoinMelcotaarsianonreWinmisneofthnedeco(eprrea fomcoinpapranhoco2.Aro

M. MirzabaH. Sarfaraz

ion Research, Se

orward/reverustomer demelma et al.

CLSC with can demand eveloped a etwork. Beamnteger linear chelon CLSCemanufacture

Another issorward/reveronsiderable acilities suchr manufacturommon facilomplexity,

maintenance oint of view,nfrastructure.

MILP model lectronic proommon faciabu search mrticle has imple assumpnd location only one plaemanufacturi

Wang [16] pntegrated forw

manufacturings one of theetwork desigf remanufacthe same. Thuew productemands. Hoonsider somee.g., capacroduction, aneturned produ

mathematiorward/ re

manufacturingollection comn two modesarameters. Oroduct flow nd reverse orizon with ost. .2. Vehicle ro

As mentionedoutes is one

aghi, A. Rashz

eptember 2016, V

se logisticsmand for rem

[13] consiapacitated fa

and returMILP form

mon et al. [programing

C, in which ed products isue in dse logistics attention is

h as distriburing/ recoverlities not onl

but alsocosts are re, duo to using. Lee and D

to design oducts withlities and smeta-heuristisome weakptions such aof common fant. Also, ing process ipresented a ward/reverseg/recovery coe most popugn. It also atured producus, remanufacts, come towever, the real-worldcity constnd the unceucts). Pishvacal model verse logig/ recovermmon facilits with stochOutputs of among variodirection ththe objectiv

outing probled earlier, fiof the mos

hidi Komijan

Vol. 27, No. 3

s system manufactureidered a macilities and rned produ

mulation to [14] develop

formulationthe quality

is the same. design of

networks ths the use oution/ collectry centers. Cly reduces tho construceduced fromg common fa

Dong [15] dthe CLSC

h distributioolved this mic algorithm

knesses. Foras the speciffacilities andin reverse s considered

model on e logistics neommon facilular models

assumes that cts and new ctured produto market

heir model d important atraints, mertainty in daee et al. [10

to design istics netwry and dies and dispo

hastic and dtheir model

ous facilitieshroughout thve of minim

ems finding optimst important

289*& A.

based on d products.

multi-product uncertainty

ucts. They design this

ped a mixed n for a four-of new and

integrated hat received of common tion centers Considering he planning ction and

m economic facilities and developed a network of n/collection model with

m. But, this r example, fied number d the use of flow, only

d. Zhou and design of

etwork with lities, which

for CLSC the quality products is

ucts, such as to satisfy does not

assumptions multi-product demand and 0] proposed

integrated work with distribution/ osal centers

deterministic l were the

s in forward he planning mizing total

mal vehicle operational

Page 4: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

290 M. H. S

decisions significantlservice. MamanagemenoperationalProblem (Ramser [1operations sciences. Bso-called C(CVRP), costumers for a homserved by capacity badetermine total cost oroute startcustomer istotal demanvehicle caextensions optimizatiomajority ofof effectivereview papcomprehenet al. [19]. Since the Ramser in in many wworld aspevariants of is Multi-destudied byassumes thscattered amis visited bthese depota same deMDVRP problem. Smodel for echelon sumethod to model to a[22] propoheuristic apthat minimIn another time horizobe made inproblem iseach periodover the p

Mirzabaghi, Sarfaraz

Internationa

in CLSC ly reduce coany of the stnt did not l decision. (VRP), intro17], is a

research aBasic formulaCapacitated in which around a ce

mogeneous phomogeneou

ased at the da set of del

over a singlets and endss served by nd on each

apacity. Thisare N

on problems f articles foce solution prpers in this nsive review first article 1959, this p

ways by intects, resultinf the VRP. Oepot VRP (My Sumichrashat multiple mong the cuby a vehicle ts (i.e., each epot). Wu e

to multiplSepehri et a

multi-produupply chainsolve the pro

a single prodosed a matpproach for mizes total trakind of VRP

on, and delivn different d to find a fed, such that planning ho

A. Rashidi K

al Journal of Ind

managemeosts and imptudies in the

consider tThe Veh

oduced by well-known

applied to ation of this Vehicle Rougeographica

entral depot product. Theus vehicles wdepot. The Clivery routes period, such

s at the deponly one veroute does ns problem aNP-hard [18]. For th

cused on therocedures. Tfiled in thecan be foun

of VRP byproblem has troducing adng in a larg

One of the vaMDVRP), wh

st et al. [depots are gstomers and that is assigroute must s

et al. [21] le-depot lo

al. [22] propuct MDVRPn. They uoblem by deduct model. Mthematical multiple prodveled distancP, planning iveries to thedays. The obfeasible routithe total cosrizon is mi

Komijan*& A

dustrial Engineer

ent that cprove custom

area of CLSthis importahicle Routi

Dantzig an problem

transportatiproblem is tuting Proble

ally dispershave deman

ey have to with a limitCVRP aims s of minimuh that: (i) eapot; (ii) eaehicle; (iii) tnot exceed tand all of

combinatorhis reason, te developme

There are some literature. nd in Eksiog

y Dantzig abeen extenddditional reage number ariants of VRhich was first20]. MDVRgeographicaleach custom

gned to one start and end developed t

ocation-routiposed a MILP in a mulsed Lagrancomposing tMahdavi et model and ducts MDVRce. is made overe customer cbjective of thing solution st of the routinimized. Th

A. C

ring & Producti

can mer SC ant ng nd in on the em sed nds be

ted to

um ach ach the the its ial the ent me A

glu

nd ded al-of

RP tly RP lly

mer of at

the ng LP lti-

nge the al.

a RP

r a can his in

tes his

prRBfoCprwFrprcuA(MreburesualInsttheaenisvevesethbeflroKcoflgeOdevepicopr[3alalDsia loVdigrfrouRapin

Closed Loop Su

ion Research, SE

roblem is Routing Probl

eltrami et aormulation o

Christofides eresented an

with pre-defirancis et aroblem, in wustomer was

An extensionMDPVRP). eceived a greut the MDPelatively fewuch as Kanglgorithm to sn the basic Mtart and end he number ofach vehicle nds in the sas developed ehicles to reehicle startservicing to suhat servicing e performedexibility in

oute as "flexKek et al. onsidered a exible assignenetic algorit

One of the vaeal with theehicle routiickup and dostumer requroblem has b31]. A generall deliveries ll pickups mu

Deliveries imultaneousl

vehicle andoading at ea

VRPSPD is istribution syrocery storeresh food outdated item

Reverse logispplication antegration of

upply Chain P

Eptember 2016, V

known as lem (PVRP) al. [24] and of this proet al. [26]. extension o

ned days toal. [27] devwhich the nu

a decision vn of PVRP The MDVR

eat deal of atPVRP has b

w studies haveg et al. [28

solve this proMDPVRP, ev

in the samef vehicles of starts its tra

ame depot. Ain which no

eturn to the s from an iub-set of cosof the custo

d at lower determining ible assignm[29]. Eydi MILP modenment and sthm. riants of VR

e issues in ring problem

delivery (VRuires both debeen introdual assumptiomust be origust be transpand pickuy when eachd unloadingach custome

frequently ystem of groe may have or soft drin

ms or emptystics and Carea for VRf forward a

Planning Wit

Vol. 27, No. 3

the Periodwhich is intthe first m

oblem is prFoster and

of PVRP to o visit eachveloped PVumber of vivariable of th

is Multi-deRP and the Pttention in th

been rarely se been done 8], that useoblem. very vehicle e depot. In of each depot avel from its

A new type oo obligation

initial depoinitial depotstumers, endomers in the cost. The ithe last dep

ment" was intand Abdor

el for the MDsolved this

RP that is widreverse logim with si

RPSPD), in welivery and puced first byn in this proginated from

ported back tups must h customer ig is carried er. The app

encountereocery store c

both a delnk) and pi

y bottles) deCLSC are alRPSPD. In and reverse

th Vehicle …

dic Vehicle troduced by

mathematical roposed by

Ryan [25] a problem

h costumer. VRP for a isiting each he problem. epot PVRP PVRP have he literature, studied and in this area. d an exact

route has to other words, is fixed and s depot and f MDPVRP is made to

ot and each t and after

ds to a depot next period

idea of the pot of each troduced by rahimi [30] DVRP with model with

dely used to istics is the imultaneous which each

pickup. This y Min et al. blem is that

m the depot, o the depot.

be met s visited by out before

plication of ed in the

chains. Each livery (e.g., ckup (e.g.,

emand [32]. lso another

this case, flows (for

Page 5: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

instance, collection) Dethloff [VRPSPD idepot. Thissubsequentmultiple deand deliverIn the majocustomer ionly oncealways reademand excase, the pocustomer Deliveries that allowicosts up to As said earthe majoritmainly focapproachesheuristic efficient mproblem haresearchersformulationmoderate-scommerciaand/or malgorithms motivation according ton vehicle Therefore, is proposedrouting proechelon clo 3. Proble

In this papeperiod, anchain netwThis chaincenters, discenters andsaid in theforward asimultaneomodel, we Moreover, common acsaves morethe opedistribution

p Supply Cha

Internationa

integration is a suitable

[33] developin a reverse ls model hast studies. Salepots VRP ry. ority of vehis served by . However,

alistic becausxceeds the ossibility of characterize(SDVRP) A

ing split serv50%.

rlier, VRP isty of studies cused on hes. Despite tapproaches

mathematicaas received s. Howeverns may allosized problemal package omathematical

for the prof our pa

to the literatrouting in in this pape

d to combineoblems and imosed-loop sup

em Descriper, we consid

nd multi-prowork considn consists stribution/ cod customers’e literature and reverseusly and aim to prevemploying

ctivities (e.g.e money, timerational cn/collection

ain Planning W

al Journal of Ind

of distre approach toped a MILlogistics netw

s been devellhi and Nagi with simulta

cle routing ponly one vthis assum

se sometimesvehicle capmultiple vis

es the VRPArchetti et alvicing can r

s an NP-hardon this prob

euristic and the increasin

for VRPal formulati

much less r, efficient ow us to som instance or to develo

model-basroblem. Thisaper. On theture, there isclosed-loop

er, a comprehe different tymplement thpply chain.

ption and Fder a multi-eoduct closeddering comm

of productollection faci nodes (see review sect

e features proposing

vent sub-optig common ., production

me and energycost. Eac

(productio

With Vehicle

dustrial Enginee

ribution ao cost saving

LP model fwork with oloped in man[34] propos

aneous picku

problems, eavehicle exactmption is ns the custom

pacity. In thits to the samP with Spl. [35] showreduce routi

d problem, thblem have be

meta-heuristng interest

P, developiions for thattention fro

mathematicolve small by using anop new exased heurists is the mae other hans a few studi

supply chaihensive mod

ypes of vehichem in a mul

Formulationechelon, muld-loop suppmon facilitietion/ recoveilities, disposFig. 2). As wtion, with t

of netwoan integratimal solution

facilities fn and recovery and decreach common/ recover

……

ering & Producti

nd gs. for

one ny

sed up

ach tly not

mer his me plit

wed ng

hus een tic in ng his om cal or ny act tic ain nd, ies in. del cle lti-

n lti-ply es. ery sal we the ork ted ns. for ry) ase on ry)

cefo(rco

Inprdiprtothdi[1thpranfoththdilimflMpltrinecprannoIntrceasitspeth(cfr

M. MirzabaH. Sarfaraz

ion Research, Se

enter plays aorward flowrecovery) ronsidered at

Fig. 2.

n this networroducts fromistribution/coroducts, whio the producthat are notisposal cente16], demandhrough the roducts. Thend recovereorward flow,he productionhe end istribution/comitation for eet.

Moreover, thlanning at ansportation

ndependent chelons are roblem) and n initial cenodes, go to an each perioavel at a ceenters are nssignment). s travel fromeriod. In the he products tcostumers) arom it simult

aghi, A. Rashz

eptember 2016, V

a distributorw on the net

ole in thePishvaee et a

. The consi

rk and in them customers ollection ceich are recovtion/recoveryt recoverablers. Accordid of custom

recovered ey assumed ted products the new andn/recovery ce

customeollection cen

all facilities

e model deeach ech

n vehicles of other ecindirect (toueach vehicl

nter and aftea final center.od, each vehenter, so thnot the samIn each perim the final echelon 1 (2o the distribu

and picks uptaneously (V

hidi Komijan

Vol. 27, No. 3

r (producer) twork, and e reverse al. [10]).

dered netw

e reverse floare transpo

nters. Someverable, are y centers andle are traning to Zhou mers can b

products that the qua

is the samd recovered penters are tra

ers throunters. There is and the tra

eals with trahelon. The

in each echelons. Traur; such as le starts its

er servicing .

hicle starts aat the initia

me necessariliod, each vecenter in th

2), each vehiution/ collecp the returnRPSPD). In

291*& A.

role in the a collector one (e.g.,

work

ow, returned orted to the e of these transported

d the others nsported to

and Wang be satisfied

and new ality of new me. In the products by ansported to ugh the s a capacity ansportation

ansportation employed

chelon are avels in all

the routing travel from a subset of

and ends its al and final ly (flexible ehicle starts he previous icle delivers ction centers ned product the echelon

Page 6: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

292 M. H. S

1 (2), in distributionsatisfied by(i.e., split echelon distributionone vehicleIn the firsproducts ineach periodcapacity), anext perioregarding required prrecovery cproducts tocenters (sreturned pproduction/returned distributionto the custocollected production/the next pproducts arcustomers. the produplausible flIn the secvehicle (reup requiredistributionsubset of collect the one of thecollected deliveries Mixed inte Sets: A B C D T P K1 K2 K3

Parameterst1p,i Tt2p,i T

Mirzabaghi, Sarfaraz

Internationa

each perion/ collection y multiple vservicing is3 in

n/collection e exactly onlst echelon, n each prodd can be stocand after thaod. In each

its capacitroducts fromenter and stao a subset simultaneousproducts) an/ recovery products.

n/collection omers in the

returned /recovery ceperiod). On re produced In each of pcts can beluctuation in cond echeloegarding its ed productsn/ collection

customers returned pro

e distributionreturned

to customer

ger linear pr

The set of pThe set of dThe set of cThe set of d

The set of pThe set of pThe set of eThe set of eThe set of e

s: Time to prodTime to rema

A. Rashidi K

al Journal of Ind

od, the demcenter (cus

visits by mus allowable)

each pecenter is sey once. produced a

duction/recovcked (regardat can be dish period, ty limitatio

m the stock ofarts its traveof distributily, vehicles

nd returns tcenters w

(Delivered centers can next period,

products enter are rem

the other regarding t

production/ree stocked t

demand. on, in each

capacity lims from the

center, deliv(simultaneou

oducts), and rn/ collectionproducts.

rs are allow

rogramming m

production/redistribution/customers

disposal cente

periods t Tproducts pmployed vehmployed vehmployed veh

duce a unit ofanufacture a

Komijan*& A

dustrial Engineer

mand of eastomer) can ultiple vehicl). But, in teriod, eaerved by on

and recoververy center ding to holdistributed in teach vehic

on, picks uf a productioel and deliveion/ collectis collect to one of t

with collectproducts

be distribut, and all of t

in eamanufactured

side, the nethe demand ecovery centto tackle t

period, eamitation) pice stock of vers them tously, vehiclreturns them n centers wiShortages

wed (lost sal

model (MIL

ecovery centeollection cen

ers , /i j A P

hicles in the hicles in the hicles in the

f product p aa unit of prod

A. C

ring & Producti

ach be les the ach nly

red in ng the le, up

on/ ers on the the ted to

ted the ach

at ew of er, the

ach cks

a o a les to

ith in

e),

buAprseofrethnostdiInstthditoprnowinhoAInexco

P):

ers nters

/ /B C D

first echelonsecond echethird echelon

at productionduct p at pro

Closed Loop Su

ion Research, SE

ut pickups Also, there is roducts in theveral periodf them areecovery. cenhe disposal otable that thtock the nistribution ton the third ectarts its travehe unrecoveistribution/coo one of throducts. In thot allowed to

with the aim oncluding oolding, and t

Assumptionsn the sectioxpressed. Aonsidered in

- The planni

- The nfacilit

- In eheterooperat

- The nin all deliveto/fromparam

n lonn 1 / 2k K K

n/recovery ceoduction/reco

upply Chain P

Eptember 2016, V

from customno possibili

he distributiods, so that re transportenters and the

centers in he distributioew and re

o the customechelon, in eael from a dirable produollection cenhe disposal his echelon, oo. The netwof minimizin

of productitransportation:

on above, soAdditional a

the modelingnumber of

ing horizon inumber, capaties are knoweach echeloogeneous, wite independe

number and lperiods are

ery demand m each cu

meters are det

2 / 3K

enter i (hourovery center

Planning Wit

Vol. 27, No. 3

mers are noity to stock tn/ collectionrecoverable

ed to the e rest are tra

the next peon/collection ecovered prers in the nexach period, eisposal centeucts from anters, and recenters witshortage in

work should ng total operion, remann.

ome assumpssumptions g are: f periods is defined an

acity, also locwn. on, the veith certain c

ently of otherocation of alknown and and returne

ustomer andterministic.

) i (hour)

th Vehicle …

ot allowed. the returned n centers for

proportions production/

ansported to eriod. It is centers can

roducts forxt periods. each vehicle er, picks up a subset of eturns them th collected pickups are be planned

rational cost nufacturing,

ptions were which are

during the nd limited. cation of all

ehicles are apacity and r echelon. ll costumers quantity of

ed products d also all

Page 7: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

t3i Tc7p,i Pc8p,i Rc9i Dci,j Tti,j Thh1 H

rhh2 H

cq1 S

u2i,t Pu4i,t R

u1i Ht

u3i Ht

u5i Cu6i,t Dq1k Cq2k Cq3k Cdj,p,t Dpj,p,t Qsp Prt DM AVariables:

, , , 1i j k tx

, , , 1i j k ty

, , , 1i j k tz

, , , 2 i j k tx

, , , 2 i j k ty

, , , 2 i j k tz

, , , 3i j k tx

, , , 3i j k ty

, , , 3i j k tz

, , 1p i tg

, , 2 p i tg

, 3i tg

, ,1p i tv

, ,1 p i th

, ,1p i ts

p Supply Cha

Internationa

Time to dispProduction cRemanufactuDisposal cosTravel cost fTravel time fHolding costrecovery cenHolding costcollection ceShortage cos

Production cRemanufactuHolding captype)Holding captype)Collection caDisposal capCapacity of vCapacity of vCapacity of vDemand of cQuantity of rProportion oDuration of pA large posit

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

1 if vehicle

The amoun

The amoun

The amoun

The amoun

Inventory beginning Inventory recovered p

ain Planning W

al Journal of Ind

ose a unit ofcost of produuring cost of st of each profrom node i tfrom node i tt of product p

nters t of product penters st per unit

capacity of pruring capacitpacity of pro

acity of dist

apacity of dispacity of dispvehicle k whvehicle k whvehicle k whcustomer j foreturned prodf unrecoveraperiod t (houtive constant

e 1k K trav

e 1k K trav

e 1k K trav

e 2k K trav

e 2k K trav

e 2k K trav

e 3k K trav

e 3k K trav

e 3k K trav

nt of product

nt of product

nt of product

nt of shortage

of product pof period t level of pr

products at th

With Vehicle

dustrial Enginee

f product p ct p per unit

f product p peoduct per unio node j to node j per unit (Ind

per unit (Ind

roduction/recty for producoduction/reco

tribution/coll

stribution/coposal center ihich employehich employehich employeor product p iduct p of cosable returnedur) t

vels from nod

vels from nod

vels from nod

vels from nod

vels from nod

vels from nod

vels from nod

vels from nod

vels from nod

t p manufactu

t p recovered

t disposed in

e of product

p in product

roduct p in he end of pe

……

ering & Producti

at productionat productio

er unit at proit at disposal

dependent of

dependent of

covery centection/recoverovery center

lection cente

ollection centi in period t (ed in the firsted in the secoed in the thirdin period t stumer zone jd products

de i to node j

de i to node j

de i to node j

de i to node j

de i to node j

de i to node j

de i to node j

de i to node j

de i to node j

ured in produ

d in productio

disposal cen

p in costume

ion/recovery

production/riod t

M. MirzabaH. Sarfaraz

ion Research, Se

n/recovery con/recovery coduction/reco

center i

f product typ

product type

er i in period ry center i in

i in period

er i in period

ter i in period(hour) t echelon k ond echelon d echelon k

j in period t

j in period t.

j in period t.

j in period t.

j in period t.

j in period t.

j in period t.

j in period t.

j in period t.

j in period t.

uction/ recov

on/ recovery

nter i at perio

er i at period

y center i aft

/recovery ce

aghi, A. Rashz

eptember 2016, V

enter i (hourcenter i overy center

e) per period

e) per period

t (hour) period t (hout (Independ

d t (Independ

d t

1K 2k K

3K

( , i j B ); o

( , i A j B

( , i B j A

( ,i j C ); ot

( , i B j C

( , i C j B

( , i j B ); o

( , i D j B

( , i B j D

very center i

center i at p

od t

d t

fter loading t

enter i after

hidi Komijan

Vol. 27, No. 3

r)

i

d at producti

d at distributi

ur)dent of prod

dent of prod

otherwise 0

); otherwise

); otherwise

therwise 0

C ); otherwise

B ); otherwise

otherwise 0

B ); otherwise

D ); otherwise

at period t

period t

the vehicles

adding new

293*& A.

on/

on/

duct

duct

e 0

e 0

e 0

e 0

e 0

e 0

at the

w and

Page 8: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

294 M. H. S

, ,2 p i th

, ,2p i ts

, , ,1k i p tl

, , ,2 k i p tl

, , , ,1k i p j ta

, , , ,1k i p j tb

, , ,2 k i p ta

, ,1k i to

, ,1k i tn

, ,1 i k tu

, , ,3k i p tl

, , ,4k i p tl

, , , ,3k i p j ta

, , , ,3 k i p j tb

, , ,4 k i p ta

, ,2 k i to

, ,2 k i tn

, ,2 i k tu

, , ,5k i p tl

, , ,5 k i p ta

, ,3k i to

, ,3k i tn

, , , ,4 k i p j tb

, ,3 i k tu In terms of Objective Min Z

2t T k K i B j

3t T k K i D j

Mirzabaghi, Sarfaraz

Internationa

Inventory lthe beginniInventory recovered pLoad of prbeginning Load of prperiod t Amount distributionAmount odelivered tSum of retthe end of p

1 if vehicle

1 if vehiclotherwise 0The sub touLoad of prthe beginni

Load of pro

Amount ovehicle k Amount odistributionSum of retat the end o1 if vehicle0 1 if vehiclotherwise 0The sub touLoad of prperiod t Sum of retperiod t

1 if vehicle

1 if vehicle

Amount odelivered t

The sub tou

f the above n

function:=

t T k

, , ,.2 ii j k t

Cy c

, , ,.3i j k t

j By c

A. Rashidi K

al Journal of Ind

level of proding of periodlevel of proproducts fromroduct p of vof period t roduct p of

of producn/collection cof returned o productionturned produperiod t

e 1k k is in

le 1k k is i0 urs eliminatiroduct p of ing of period

oduct p of v

f product p 2k at perio

of returned n/collection cturned produof period t e 2k k is in

le 2k k is in0 urs eliminatiroduct p of

turned produ

e 3k k is in

e 3k k is in

of returned o disposal ce

urs eliminati

otations, the

11

k K i A j By

, j

2t T k K i C

,i jc 3t T k K i

Komijan*& A

dustrial Engineer

duct p in distd t oduct p in dim production

vehicle k k

vehicle k

ct p delicenter i by vproduct p p

n/recovery ceuct p delivere

n the producti

in the produ

ion variable ivehicle k k

d t

vehicle k k

delivered frd t

product pcenter j by v

uct p delivere

n the distribut

n the distrib

ion variable ivehicle k k

uct p deliver

n the disposal

n the disposal

product p penter j by veh

ion variable i

proposed M

,, , ,.1 i ji j k t c

, ,,

2i jC j C i j

x

,3

i B j B i jx

A. C

ring & Producti

tribution/coll

istribution/con/recovery c1 when leav

1k after serv

ivered fromvehicle 1k kpicked up fenter j by vehed to produc

ion/recovery

uction/recove

in the first ec

2k when lea

2 after servic

from distribu

p picked uvehicle 2k ked to distrib

tion/collectio

bution/collect

in the second

3k after serv

ed to dispos

l center i at th

l center i at th

picked up fhicle 3k k

in the third e

MILP model i

1t T k K i B j

, ,.k t i jc

t T k

, , , ,.

i j k t i jc t T

Closed Loop Su

ion Research, SE

lection cente

ollection cenenters at the

ving the prod

vicing the dis

m product1 at period tfrom distribhicle 1k kction/recover

y center i at th

ery center i

chelon aving the dis

cing the costu

ution/collecti

up from co2 at period tution/collect

on center i at

tion center i

d echelon vicing the dis

sal center i b

he end of per

he beginning

from distribat period t

echelon

is presented a

, , ,,

.1i j k tB i j

cx

22

K i C j Bz

3T k K i B j Dz

upply Chain P

Eptember 2016, V

er i after load

nter i after rend of perio

duction/recov

stribution/col

tion/recovery

bution/collectat period t

ry center i by

he end of per

at the begin

stribution/col

umer i in per

ion center j

ostumer i a

tion center i

t the end of p

i at the begi

stribution/col

by vehicle k

riod t; otherw

g of period t;

bution/collect

as follows:

,i jc t T k

, , , ,.2i j k t i jc

, , , ,.3i j k t i jz c

Planning Wit

Vol. 27, No. 3

ding the vehi

receiving newod t very center i

llection cent

y center

tion center

y vehicle k

riod t; otherw

nning of per

llection cent

riod t

to costume

and deliver

by vehicle

period t; othe

nning of per

llection cent

3k at the e

wise 0

; otherwise 0

tion center

,1

1iK i B j A

z

th Vehicle …

cles at

w and

at the

ter i in

j to

i and

1k at

wise 0

riod t;

ter i at

r i by

red to

2k k

erwise

riod t;

ter i in

end of

0

i and

, , ,.

j k t i jc

(1)

Page 9: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

t T p P i Ag

2t T p P i B

h

Subject to

, , ,1

i j k ti A

y

,1

ii A j B

y

1i A j B

y

, , ,1

i j k ti A

y

,1i

i B j B i jx

, ,1 1i k tu u

, ,1k i ti A

n

, ,1k i ti A

o

, ,1

i j kj B

y

, , ,1j i kj B

z

, , 11k i to n

, ,1k i to n

, , ,1k i p tj

l

, , ,1k i p tp P

l

, , ,2k j p tl l

, , ,2k j p tl l

, , ,2 2k j p tl l

, , ,2 2k j p tl l

11k

i A k Kb

, , ,2 k j p tp P

l

, , ,1k j p ip P

a

p Supply Cha

Internationa

,, ,.1 7p ip i t c

t

, , .2 2p i t hh t

:

, ,,

1i j ki B i j

x

, ,j k ti B j A

z

, , ,1

i j k t

, , ,,

1i j k ti B i j

x

, , ,i j k ti A j B

y

, ,1 (j k t B

1

1

, ,, 1k i tt n

, , ,1t k i to

, ,1k i tn

, ,(11k i t

jn

, , , ,1k j p i tj B

a

1k

q

, , , , , ,11k i p t k j pa

, , , , , ,11k i p t k j pa

, , , ,12k i p t k ji A

a

, , , ,12k i p t k ji A

a

, , , ,2

k j p i tk K

1t kq

, , , ,1i t i j k t

y

ain Planning W

al Journal of Ind

,2p iT p P i A

g

1pT p P i C

v

,1

t

, , ,1i j k tz

, , ,,

1j i k ti B i j

x

, , ,.1

i j k tMy

, , ,1). 1i j k tx

, , , )1i j k tj B

y

, , , , ,1i t k j pi A

b

, , , , ,1i t k j pi A

b

, , , , ,1j p i t k ji A

b

, , , , ,1j p i t k j pi A

b

, , , 12

.(4k j p ta

,1it

i B i jx

With Vehicle

dustrial Enginee

,,. 8p it c

t T i

, ,. 1p i t q

, , ,1t j i k ti A

z

B

) 1

, , ,.(1 1i t i j

M y

, , ,.(1 1i t i j

M y

,, , ,.(1 1ip i t

M x

,, ,.(1 1i jp i t

M x

(1 )sp

, , ,.

j k tM

……

ering & Producti

,.3 9 ii t

Dg c

, ,)

j k t

, ,)

j k t

, , ,)

j k t

, ,)

j k t

M. MirzabaH. Sarfaraz

ion Research, Se

i

t T p P i A

j B

k

k

j

k

,i j

k

k

k

k

k

k

k

k

k

k

k

k

j

k

k

aghi, A. Rashz

eptember 2016, V

, ,.1 1p i th hh

, , 1B t k K

1,K t

1,K t

, 1,B k k t

1,K t

( )j B i j

1,K t

1,K t

1, ,K t i A

1, ,K t i A

1, 2,K t i

1, ,K t i A

1, , ,K t i A p

1, ,K t i A

1, , ,K t p i A

1, , ,K t p i

1, , ,K t p i

1, , ,K t p i

, ,B t p

1, ,K t j B

1, , ,K t i A

hidi Komijan

Vol. 27, No. 3

), 1,k k t

A

A

p

,A j B

,A j B

, ,B j B i

, ,B j B i

j B

295*& A.

(2)

(3)

(4)

(5)

(6)

(7)

(8)

(9)

(10)

(11)

(12)

(13)

(14)

(15)

(16)

(17)

j (18)

j (19)

(20)

(21)

(22)

Page 10: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

296 M. H. S

1kp P j B

a

, ,1k j pi A p P

b

1kj B p P

b

, , ,2

i j k ti B

y

,2

i ji B j C

y

2i

i B j C

y

, , ,2

j i k tj B

y

,2

i C j C i jx

, ,2i k tu u

, ,2 k i ti B

n

, ,2 k i ti B

o

, ,2

i j kj C

y

, ,2 j i kj C

z

, , 12k i to

, ,2k i to n

, , ,3k i p tj

l

, , ,3k i p tp

l

, , , 34k j p t ll

, , , 34k j p t ll

, , ,4 4k j p tl l

, , ,4 4k j p tl l

, , ,4 k j p tp

l

23

i B k Kb

Mirzabaghi, Sarfaraz

Internationa

, , , ,j p i tj B

, , , ,1p i t i j k

i A

y

, , , ,k j p i tj B

, , ,,

2i j k ti C i j

x

, , 2j k ti C j B

Z

, , ,1

j k t

, , ,,

2j i k tj C i j

x

, , ,2i j k ti B j C

, ,2 (j k t C1

1

, ,, 2 k i tk t n

, , ,2k t k i to

, ,2k i tn

, ,(12k i t

jn

, , , ,3k j p i tj C

a

2k

q

, , , , , ,3 3k i p t k j p ia

, , , , , ,3 3k i p t k j p ia

, , , , ,34k i p t k j pi B

a

, , , , ,34k i p t k ji B

a

2k

q

, , , ,3k j p i t jp

A. Rashidi K

al Journal of Ind

, , ,.1

i j k tMy

,,,

1i jk ti B i j

x

, , ,.1j i k tMz

1t

, , ,2i j k t

, , ,,

2i j kj C i j

x

, , ,.2

i j k tC

My

, , ,1). 2i j k tx

, , ,2 )i j k tj C

y

, , , , ,3i t k j p i ti B

b

, , , , ,3i t k j p i ti B

b

, , , , ,3p i t k j p ii B

b

, , , , , ,3p i t k j p ii B

b

, ,j p t

Komijan*& A

dustrial Engineer

M

, ,.

j k tM

M

, , , ,2t i j k tj B

z

t C

1

, ,.(1 2t i j k

M y

, ,.(1 2t i j k

M y

, ,,.(1 2i j ki t

M x

, ,,.(1 2i ji t

M x

A. C

ring & Producti

,)

k t

,)

k t

,)

k t

,)

k t

Closed Loop Su

ion Research, SE

k

k

k

j C

k

k

i

k

,i j

k

k

i

i

k

k

k K

k

k

k

k

k

k

,t p

upply Chain P

Eptember 2016, V

1, ,K t i A

1, ,K t j B

1, ,K t i A

, , 2C t k K

2,K t

2,K t

, 2,C k k

2,K t

( )j C i j

2,K t

2,K t

, 2,B k k t

, 2,B k k t

2, 2,K t i B

2, ,K t i B

2, , ,K t p i B

2, ,K t i B

2, , ,K t p i

2, , ,K t p i

2, , ,K t p i

2, , ,K t p i

2, ,K t j C

,p j C

Planning Wit

Vol. 27, No. 3

t

), 2,k k t

B

,B j C

,B j C

, ,C j C i

, ,C j C i

th Vehicle …

(23)

(24)

(25)

(26)

(27)

(28)

(29)

(30)

(31)

(32)

(33)

(34)

(35)

(36)

(37)

(38)

(39)

(40)

(41)

j (42)

j (43)

(44)

(45)

Page 11: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

, , ,3k j p ipa

,3kp j C

a

, ,3k j pp i B

b

3kp j C

b

,3

3i j

k K i D

y

,3

3i jk K j D

z

,3

i ji D j B

y

3i D j B

y

, , ,3

j i k tj D

y

,3

i B j B i jx

,3 3i t ju u

, ,3k i ti D

n

, ,3k i ti D

o

, , ,3

i j k tj B

y

, , ,3j i k tj B

z

, , 13k i to

, ,3k i to n

, , ,5k j p tl

, , ,5k j p tl

, , ,5k j p tl l

, , ,5k j p tl l

, , ,5k j p tp

l

p Supply Cha

Internationa

, , ,2i t i j k

y

, , , ,j p i tj C

y

, , ,2p i t i

i B

y

, , , ,k j p i tj C

, ,3 ,

j k tk K i B i

, ,3 ,

j k tk K j B i

, , 3j k ti B j D

Z

, , ,1

i j k t

, ,,

3 j ij B i j

x

, , ,3i j k ti D j B

, ( 1)j t B

1

1

, ,3k i tt n

, ,3t k i to

, ,3k i tn

, , (13k i tn

, ,4k j pi D

b

, ,4k j pi D

b

, , ,5k i p ti D

l b

, , ,5k i p ti D

l b

3k

q

ain Planning W

al Journal of Ind

,,

2ti C i j

x

, , ,.2

i j k tMy

, , ,,

2j k ti C i j

x

, , ,.2 j i k t

Cz

, , ,13i j k t

jx

, , ,13i j k t

jx

, , ,3i j k t

, ,,

3k tj B i j

x

, , ,.3

i j k tB

My

, , ,3

. 3i j kk K

x

, , ,3i j k tj B

y

, ,.(1

p i ti

M

, ,.(1

p i ti

M

, , , ,4k j p i tMb

, , , ,4k j p i tMb

With Vehicle

dustrial Enginee

, , ,.2i j k tM

M

, , ,.2i j k tM

M

, , ,3 3i j k tj D

z

,t B

) 1t

, , ,)3

i j k tD

y

, , ,)3

i j k tD

y

, , ,.(1 )3i j k t

M x

, , ,.(1 )3i j k t

M x

……

ering & Producti

, , ,i j k t

)

)

M. MirzabaH. Sarfaraz

ion Research, Se

k

k

k

k

j B

i B

k K

k

i

k

,i j

k

k

i

i

k

k

k

k

k

k

k

aghi, A. Rashz

eptember 2016, V

2, ,K t j C

2, ,K t i B

2, ,K t j C

2, ,K t i B

,B t

,B t

3,K t

3,K t

, 3,B k k

3,K t

( ),j B i j

3,K t

3,K t

, 3,D k k t

, 3,D k k t

3, 2,K t i D

3, ,K t i D

3, , ,K t p j

3, , ,K t p j

3, , ,K t p i

3, , ,K t p i

3, ,K t j B

hidi Komijan

Vol. 27, No. 3

,i B

C

t

3,k k t

D

D

B

B

, ,B j B i

, ,B j B i

B

297*& A.

(46)

(47)

(48)

(49)

(50)

(51)

(52)

(53)

(54)

(55)

(56)

(57)

(58)

(59)

(60)

(61)

(62)

(63)

(64)

j (65)

j (66)

(67)

Page 12: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

298 M. H. S

34

k K i Db

, ,4k jp i D

b

4kp j B

b

,2

3ki B k K

a

, ,.1

p i tp P

g t

, ,2

p i tp P

g

,.3 3ii t

g t

, ,2

p i tk

g

,3

i tp

g

, , ,2k i p tj

a

, , ,4k i p ta

, , ,5k i p ta

24

p k Ka

, ,1 1pp i ts h

, , 11p i t psh

, ,1p i tp P

s

, ,2 2p j ts h

, , 22p j t sh

, ,2p j tp

s

,1

i ji A j B

y

,2

ii B j C

y

,3

ii D j B

y

binary vari

positive va

, ,1 1i k tu

, ,1 2i k tu

,1 3i tu

Mirzabaghi, Sarfaraz

Internationa

, , , ,4k j p i tk

, , , 3p i t ii D

y

, , , ,j p i tj B

, , , , , ,1j p i t p j tv

, ,1 2p i i tt u

,. 2 4p i it t u

,6 i tu

, , , 11

2k i p tK

a

, , ,3

5k i p tk K

a

, , , ,1k j p i tB

b

, , , ,3k j p i tj C

b

, , , ,4k j p i tj B

b

, , ,4 5k i p t iu

, , , ,1p i t p i t

g g

, , 11

1kp i tk K

l

1iu

, ,1

2p j ti A k K

a

, , 12

2p j tk K

l

3 ju

,, ,.

i jj k ti B j

t

,, , ,.

i jj k ti C j

t

,, ,.

i jj k ti B j

t

able:x1،y1،zriable:g1 ، g2

1B

1C

1B

A. Rashidi K

al Journal of Ind

, , ,2

4k j p tK

a

, , ,,

i j k ti B i j

x

, , ,.3 j i k tMz

, ,j p td

,i t

1t

t

t

, ,2

p i tg

, , ,k i p t

, , , ,1k j p i ta

, , ,3k j p tl

, , ,,

1i j k tB i j

x

, ,,

2 i j kj C i j

x

, , ,,

3i j k tj B i j

x

1،x2،y2،z2،x3

2 ، g3 ، s1 ، s2 ، h

Komijan*& A

dustrial Engineer

1.sp

, , , .3i j k t Mx

M

,.

t i ji B j A

t Z

, ,.

t i ji C j B

t

,.

t i ji B j D

t

3 ، y3 ، z3،n1،oh1 ، h2 ، v1،l1،

A. C

ring & Producti

, , , ,.1i j k t i jtZ

, , , ,.2 i j k t i j

BtZ

, , , ,.3i j k t i jZ t

o1،n2،o2،n3،oa1،a4، l3 ،a3

Closed Loop Su

ion Research, SE

j

,t k

i

,p t

i

i

i

i A

i

i A

i B

i D

i

i

i

i

j B

j

j

tr k

tr k

tr k

o3 ;

،l4 ، b3 ، l2 ، l5

i

i

i

upply Chain P

Eptember 2016, V

, ,B t p

3,k K j B

, , 3D t k K

,t j C

,A t

,A t

,D t

, ,A t p P

,D t

, , , 1A t p k K

, , , 2B t p k K

, , , 3D t p k K

,B t

, ,A t p

, ,A t p

,A t

, ,B t p

, ,B t p

,B t

1,K t

2,K t

3,K t

، b1 ، b4 ، a2 ، a

, 1,B k k t

, 2,C k k t

, 3,B k k t

Planning Wit

Vol. 27, No. 3

B

3

1

a5 ;

th Vehicle …

(68)

(69)

(70)

(71)

(72)

(73)

(74)

(75)

(76)

(77)

(78)

(79)

(80)

(81)

(82)

(83)

(84)

(85)

(86)

(87)

(88)

(89)

(90)

(91)

(92)

(93)

(94)

Page 13: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

, ,01p iCs

, ,02p jCs

The objectthroughouttotal travelrecovery cand dispoholding cosdistributioncosts. Consechelon. Cvehicle visat most onvehicle rourecovery cebe the samperiod, eacfrom one p(5) definesarrivals is all distribuensures thdistributionproduction/tours elimi(13) are According vehicle ( k

production/node needensures thbeginning that vehicl(13) ensurewithout mo(14) definleaving thebeginning capacity co(16) to (1vehicle distributionConstraint each proddistributionproduction/entering toperiod t-1 fmultiplied capacity co(22) and (2variable a1the logical

p Supply Cha

Internationa

tive functiont the planninl costs in acosts in prosal costs insts in producn/ collection straints (2)-(Constraints sits each distnce. Accordiute starts anenter. The st

me. Constrainch vehicle sproduction/ rs a flow bequal to the

ution/ collecthat each ven/ collection/recovery ceination consconstraints to the Con

1k k ) rou/recovery ce

d not be thhat origin of period t e at the endes that vehicloving if it is es the loade productionof each peri

onstraint for 9) define th

1k k afn/collection (20) impose

duct, the fn/ collect/recovery ce

o each distribfrom all custby the (1-sp

onstraint for 23) cite the lo1k,i,p,j,t ; Conconstraints r

ain Planning W

al Journal of Ind

n (1) miniming horizon, wall stages, poduction/ recn disposal ction/ recovecenters, and

(25) are relat(2) consid

tribution/ coing to constrnd ends at atart and end nt (4) ensurestarts their recovery cenby which the number of tion centers. ehicle can n centers ifenter. Constrastraint. Cons

of flexiblenstraints (8) ute starts anenter and thehe same. Cof each veis same as

d of period tle 1k k staidle in perio

d of vehiclen/ recovery ciod. Constravehicle k khe load of fter havin

center j es that, in peflow exitingtion centeenters be equbution/collectomers by vasp). Constraivehicle k k

ogical constrstraints (24)related to va

With Vehicle

dustrial Enginee

izes total coswhich includproduction ancovery cente

centers, totery centers ad total shortated to the fir

der that eaollection centraint (3), eaa productionnode need n

es that in earoute at mo

nter. Constraihe number departures fConstraint (travel amonf it leaves aint (7) is sustraints (8) e assignmento (11), ea

nd ends at e start and en

Constraint (1ehicle at tdestination

t-1. Constraiays in its pla

od t. Constraie 1k k whcenter i at t

aint (15) is t1k . Constrainproduct p

ng servicin period

eriod t and fg from eaer to ual to the floction center arious vehiclint (21) is t1k . Constrainaints related

) and (25) cariable b1k,i,p,j

……

ering & Producti

sts des nd ers tal nd

age rst

ach ter

ach n / not ach ost int of

for (6) ng

a ub-

to nt.

ach a

nd 12) the of int

ace int

hen the the nts of

ced t.

for ach all ow in

les the nts to ite j,t .

CthecCecthacCcocoCpdiCvepefrdieafrbyloCdeCcacecocorepeprdi(coshcedi(7codiancoof(8ancoCtimpeC

M. MirzabaH. Sarfaraz

ion Research, Se

i

j

Constraints (2he constraintchelon.

Constraints (5chelon. Conshe establishedccording t

Constraints (5onstraints aonstraints (8

Constraints (6of vehicl

istribution/coConstraint (6ehicle 3k keriod t and rom each diisposal centeach distributrom all custoy the sp. Cogical constra

Constraint (71emand is sa

Constraints (7apacity conenters, and constraint ofonstraint (7ecovered in eriod t is roduct pistribution/co

1k k ) inonstraint (76hipped fromenters to eacisposed in th79) are logicollection cistribution/ cnd (82) defonstraint (83f each produ84) and (85) nd constrainonstraint of

Constraints (8me of all veeriod is les

Constraints (9

aghi, A. Rashz

eptember 2016, V

,A p

,B p

26) to (49) ts (2) to (2

50) to (70) straints (50)d tours in thto the p57) to (62) and have s8) to (13) 63) to (66) dele 3k k aollection cen67) is the c

. Constrainfor each pro

istribution/ cers is equal tion/collectio

omers by varConstraints (aints related 1) defines thaatisfied and 72)-(73) are pnstraints oconstraint (7f disposal 75), The a

production/equal to qu

p shippeollection cenn period t6), all of um various ch disposal che next perial constraintcapacity ccollection cfine the var3) is the holduction/ recovdefine the vnt (86) is each distribu87) to (89) ehicles in alss than dur90) and (91)

hidi Komijan

Vol. 27, No. 3

are correspo25) but for

are related t to (56) gua

hird echelon problem aare flexible similar funbut in thir

efine the loadafter havingnter j in pecapacity cont (68) impooduct, the fcollection ceto the flow

on center inrious vehicles(69) and (7to variable bat a portion o

the rest wproduction anf productio

74) is disposcenters. Ac

amount of / recovery uantity of d from

nters by vario-1, and acunrecoverabl

distributioenter in eachiod. Constrats. Constraintconstraint enter. Const

riables s1p,i,t

ding capacityvery center. ariables s2p,i

the holdinution/ collecensure that

ll echelons aration of thenforce the

299*& A.

(95)

(96)

onding with the second

to the third arantee that are feasible ssumptions. assignment

nction with rd echelon.d of product g serviced

eriod t, and nstraint for

oses that, in flow exiting enter to all entering to

n period t-1s multiplied

70) cite the b4k,i,p,j,t . of customer

will be lost. nd recovery on/recovery sal capacity ccording to

product pcenter i at recoverable

various ous vehicles ccording to le products n/collection h period are ints (77) to t (80) is the

of each traints (81) and h1p,i,t;

y constraint Constraints

i,t and h2p,i,t , ng capacity ction center.

total travel and in each hat period. binary and

Page 14: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

300 M. H. S

non-negativdecision vaupper and lvariable. Finventory orecovery centers at th

No. Pro

A,B,C

1 1,2 2,3 2,4 3,

Solving ddimensionsachieve opproblems represents solution insuch as exaof computoptimal sosized probproblems rinteger sol(lower bouand Cut Branch aninteger sol

 

Fig. 3. Th

17000

17200

17400

17600

17800

18000

18200

Tot

la c

ost

be

be

Mirzabaghi, Sarfaraz

Internationa

vity restricariables; conlower boundinally, constof various pcenters andhe beginning

oblem dimen

C,D,P,K1,K2

,2,3,1,1,2,4,2,2,3,1,2,4,4,2,3,5,1,2,4,4,3,3,5,1,3,4,5,3

different ps representstimal solutiosuch as exaits ability

n reasonable amples 3 andter and the olution cannoblems. Hencregarding thlution and tund) and thealgorithm. Sd Cut algorlution and t

he converge

est integer

est possible

A. Rashidi K

al Journal of Ind

ctions on nstraint (92) ds for sub-toutraints (95) aproducts in thd distributiog of planning

nsion optimsolut

tim(seco2,K3,T

2,3 252,5 653,5 -3,7 -

problems ws the modon in proper amples 1 a

to achievetime for la

d 4. Due to lilarge comp

ot be achievce, we invehe gap betwthe best poseir convergenSolving therithm in GAthe best pos

(a)

ence (a) an

Time

Komijan*& A

dustrial Engineer

correspondinto (94) are turs eliminatiand (96) defihe productioon/ collectig horizon.

Tab. 1. N

mal tion

me onds)

optimobjectfunctivalue

(secon5 1130

50 6666- -- -

with differedel ability

time for smand 2. It ale near-optimarger problemimited memoputation timved for larg

estigated theween the bessible solutince by Brane problem bAMS, the bessible soluti

d the relatibest p

A. C

ring & Producti

ng the on ine on/ on

Traso23Gta

Numerical Emal tive ion es

nds)

near tooptimasolutio

time (second

0 - 6 -

40005000

ent to all lso

mal ms ory me, ge-ese est on

nch by est on

(iou(bthsostFisoAcasebeserene

 

ive gap (b) possible sol

0

0

0

0

0

Rel

ativ

ega

p

Closed Loop Su

ion Research, SE

4. Como evaluate th

andom examolved by Bra3.6. We hav

GHz, 4GB Rable 1.

Exampleso al on

ds)

best integer

(objectivfunction)

- -

1226017595

.e., relaxed utput in colbest possiblehe convergeolution. As tudied by diaig. 3a, the coolution and t

As we can annot be meconds. Alsetween the seconds. Thiseached in thaear to it.

between thlution.

00.005

0.010.015

0.020.025

0.030.035

0.040.045

relative

upply Chain P

Eptember 2016, V

mputationahe performan

mples with danch and Cu

ve used a syRAM. The r

ve )

Best nod(objectivfunction)

- -

11982.88317570.2

LP) are, relumns best e). In additioence of solan example,agrams of Fionvergence bthe best feassee, any si

made in theo, in Fig. olutions is les means thaat time is the

(b)

he best inte

Timgap

Planning Wit

Vol. 27, No. 3

al Experimnce of the m

different dimuts algorithmystem Intel cresults are p

e e )

Absolute gap

- -

32 277.11682 24.8

espectively, integer and

on, we shoulution to th, in Problemig. 3 in 2000between the sible solutionignificant ime solutions

3b, the reess than 0.00at the intege optimal, or

eger solutio

me

th Vehicle …

ents model, some mensions are m in GAMS core i7 1.73 presented in

e Relative gap

- -

8 0.0226 0.00141

returned as d best node uld consider he optimal

m 4, this is 0 seconds.In best integer

n is studied. mprovement

after 600 elative gap05 after 600 ger solution r the one so

on and the

Page 15: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

5. ConThis paperproduction chain. In model wasof VRP assechelon clmodel contmore realnetwork, wmulti-echelwith facilicomprised:production/disposal cemodel is awith the ablevel of theof the netwvarious typsuch as mrouting, fsimultaneoservicing. Oand Cuts model capreasonable problems. several wastochastic uncertaintya time-depcongestionmethod to extending tconsideringas tardineshipped loa

[1]. Listeto anetwOper268–

[2]. Fleis

ruwaon loand opp. 7

[3]. Melo

“Facmana

p Supply Cha

Internationa

nclusion andr contribute

planning this paper,

s presented tsumptions anlosed loop stributes to thl-world com

which is conlon closed-loities and li: comm/recovery aenters, and a multi-periobility to regare chain. Tranwork is indirpes of routingmulti-depot, flexible asus deliveryObtained nualgorithm sable to reac

time for sThe current

ays; first, coassumptio

y. Second, dependent mods. Third, desolve the lathe model tog different anss minimizad by various

Refees O ، Dekkera case stud

work design”rational Rese–287.

schmann m. aard j.،” the iogistics netwoperation ma73-156

o MT ، Nickeility locatiagement: a r

ain Planning W

al Journal of Ind

d Future Res to vehiclein a closed

a comprehto combine dnd applying tsupply chainhe literature bmplexities.

nsidered in thoop supply mited capac

mon facnd distributcustomers.

od and multrd several fansportation irect (tours). g assumption

multi-produsignment, and pick-

umerical resushows that ch the optimsmall- and paper can b

ombination ons such evelopment odel by conseveloping a rge-sized proo a multi-objnd conflict oation and s vehicles.

erences: r R A” stochdy for prod”. Europeanearch Vol. 16

،Beullens pimpact of prowork designanagement V

el S ، Saldanion and sreview.” Eur

With Vehicle

dustrial Enginee

esearches e routing and-loop supphensive MILdifferent typthem to a mun. Indeed, tby considerinThe logist

his paper, ischain netwocity which cilities tion/collectioThe proposti-product o

acilities at eain all echeloIn this mod

ns are includucts, periodrouting wiup, and sp

ults by Branthe propos

mal solution medium -siz

be extended the model bas deman

of the model sidering traffmeta-heuristoblems. Fortjective one b

objectives subalancing t

hastic approaduct recoven Journal 60, (2005), p

p. ، Beloemhooduct recoven”. producti

Vol. 10, (200

ha-da-Gamasupply charopean Journ

……

ering & Producti

nd ply LP pes ulti the ng tic s a ork

is of

on, sed one ach ons del, ded dic ith

plit nch sed

in zed

in by nd to

ffic tic th, by

uch the

ach ery of

pp.

of-ery on 1),

a F ain nal

[

[

[

[

[

[

[

[

[

[

M. MirzabaH. Sarfaraz

ion Research, Se

of Operpp. 401–

[4]. Wajszczan AssiAdvantaInternatAssocia(2005).

[5]. Stock Jlogistics

[6]. Roger R.S.،”Gtrends executiv

[7]. Pokharereverse Conserv(4), (200

[8]. Pishvae“Reverssimulateof advaVol. 47,

[9]. El-Saye

stochastintegratnetworkSystems

[10]. Pishvae

stochastintegratnetworkSystems

[11]. Pishvaerobust loop suuncertaiModelli

[12]. JayaramSrivastamodel fOperatio(1999),

[13]. Salema AQ. “A

aghi, A. Rashz

eptember 2016, V

rational Rese–12.

zuk K، “Logisting Tool tage for Agtional Congation of Ag

. R. ، “Revers managemen

D.S aGoing backw

and practicve council ، P

el S ، Muthlogistics: a

vation and R09), pp.175-

ee m ، s . ، Kse logistics ed annealinganced manu, (2009), pp.

ed M ، Afia tic optimied forward

k design.” Jos Vol. 28, (2

ee MS ، Jotic optimied forward

k design”. Jos Vol. 28, (2

ee MS ، Rabboptimization

upply chain inty”. Aping Vol. 35,

man V ، Guava R ، “A for remanufaonal Researpp. 497–50

MIG ، BarbAn optimizati

hidi Komijan

Vol. 27, No. 3

earch Vol. 1

gistics Costs to Achieve Cgricultural Egress of thegricultural

rse logistics. nt” ، oak boo

and Tibbward: reversces”. ReversPittsburgh ،p

ha A “Perspa review” ، RecyclingVo182.

Kianfar k . network de

g” .internatioufacturing t269–281 .

N ، El-Kharbization m

d/reverse supournal of Ma009), pp.107

lai F ، Razization m

d/reverse supournal of Ma009), pp. 107

bani M ، Toran approach

network depplied M(2011), pp. 6

uide V. Dclosed-loo

acturing” ، Jorch Society 8،

bosa-Povoa Aon model fo

301*& A.

196, (2009),

Analysis as Competitive

Enterprises”. e European Economists

Council of ok ،(1992).

ben-Lembke se logistics se logistics pa (1999).

pectives in Resources ، ol. 53, No.

،Karimi b esign using onal journal echnology ،

botly A” A model for

pply chain anufacturing 7–114.

zmi J “A model for

pply chain anufacturing 7–114.

abi SA “A to closed-

esign under Mathematical

637–649.

D. R ، Jr ، op logistics urnal of the ،Vol. 50,

AP ، Novais r the design

Page 16: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

302 M. H. S

of alogisEuroVol.

[14]. Beam

chainrecovCont281،.

[15]. Lee

logiscomptrans(2007

[16]. Zhou

ReveJournEnginVol.

[17]. Dant

truckScien

[18]. Gare

theortelep(1979

[19]. Eksio

VehiReviEngin1472

[20]. Sumi

heuridepoOper1047

[21]. Wu

SolutRoutEngin1393

[22]. Sepe

serviand with

Mirzabaghi, Sarfaraz

Internationa

a capacitatestics netwoopean Journal

179, No. (3)

mon B. A ، n network cvery” ، Protrol ، Vol. 15,.

d .،dong mstics networkputer prosportation re7), pp. 455-4

u Y ، Wangerse Logistnal of neering And8, No. (3), (2

tzig ، G.B. ak dispatchinnceVol. 6, (1

ey M.R. ، Johry of np-

phone laborat9).

oglu ، B. ، Vuicle Routingew” ، Comneering ، Vo

2- 1483.

ichrast ، Ristic and lo

ot routing pration Resea7- 1056.

،T.H. ، Low tions to Mting Problemneering ، Vo

3- 1415.

ehri M M, Kice card in MMulti-Level

the aim

A. Rashidi K

al Journal of Ind

ed multi-proork ، with l of Operatio), (2007),pp.

،Fernandes Cconfigurationoduction P, No. (3), (20

.،”a heuristik design fooducts reesearch part474

g Sh “Genetics NetwoTransportati

d Information2008), pp. 71

and Ramserg problem”

1959), pp. 80

hnson D.S. “A-hard comptories ،inc. ، M

ural ، A. ، Reisg Problem: mputers &ol. 57, No. 4

R.T. ، Markower bound problem” ، C

arch ، Vol. 2

،C. ، Bai ، J.Multi- Dep

m” ، computerol. 29, No. 1

Kargari M. “OMulti-Depot, l vehicle rouof minimiz

Komijan*& A

dustrial Engineer

oduct reveruncertainty

onal Research1063–1077،

C. ، “Suppln for produ

Planning a004), pp. 27

ic approach or end-of-leaecovery” t e، Vol. 4

eric Model ork Designon System

n Technology1-78.

r ، J.H. ، “T Manageme0–91.

A guide to tpleteness”،bMurray hill،N

sam ، A. ، “TA Taxonom

& Industr4, (2009), p

kham ، I.S“for a mul

Computers 2, (1995), p

.W. “Heuristpot Locatiors & Industr10, (2002), p

Optimizing tMulti-Produ

uting problezing the tot

A. C

ring & Producti

rse ” ، h ، .

ly-uct nd 0–

to ase ،

44,

of ” ، ms y ،

The ent

the ell NJ

The mic

ial pp.

“A lti- &

pp.

tic on- ial

pp.

the uct em tal

[

[

[

[

[

[

[

[

[

Closed Loop Su

ion Research, SE

distribut(1), (20

[23]. MahdavHosseinmodel Multi-prrouting vehicles(2012),

[24]. BeltramVehiclecollectio1,(1974

[25]. FosterProgramSchedulResearc(1976),

[26]. Christof

Period R14, (198

[27]. Francis

“The PeService Vol. 40,

[28]. Kang ، K

Exact APeriod ComputApplicain CBerlin/H

[29]. Kek, A“DistanVehicleAssignmMathemVol. 47,

[30]. Eydi ASolutionMulti-DFlexibilEach R(2012),

[31]. Min ، H

problem

upply Chain P

Eptember 2016, V

tion costs” 10), pp. 49-6

vi V, ninasab H. “oand heuristiroduct and

problem s”. IJIEPMpp. 303-315

mi ، E.J. ، Bode Routing on” ، Netw), pp. 65-94.

،B.A. ، Ryanmming Appling Proch Quarterlypp. 367- 384

fides ، N. ، Routing Pro84), pp.237–

،P. M. ، Smieriod Vehicle

Choice” ، T, No. 4, (200

K.H. ، Lee Algorithm for

Vehicle Schtational ations- ICCSComputer Heidelberg ، (

A.G.H., Chce- Cons

e Routing Pment of Stamatical and , No. 1-2, (20

A R*, Abdon Approach

Depot Vehicllity in Specif

Route” ، IJIEpp. 333-349

H. “The mum with simu

Planning Wit

Vol. 27, No. 3

IJIEPM. Vo61.

Khademizoffering a mic method

d Multi-depwith het

. Vol. 23,

.

in ، L.D. “Nefor Municiorks ، Vol.

n ، D.M.، “roach to th

oblem” ، y ، Vol. 274.

،Beasley ، J oblem” ، Netw

256.

ilowitz ، K.Re Routing Pr

Transportatio06) , pp. 439–

،Y.H. ، Lee r Multi Depoheduling PrScience

SA 2005 ، LeScience

(2005), pp. 3

heu ، R.L. strained

Problems wiart and End

Computer 008), pp. 140

orahimi H “for Multi-

e Routing Prfying the LaPM Vol. 23

9.

ultiple vehicultaneous de

th Vehicle …

ol. 21, No.

zare H, mathematical

for solving pot vehicle terogeneous , No. (3),

etworks and ipal Waste 4, ، No.

“An Integer he Vehicle Operational

7, No. 21,

،E. “The works ، Vol.

R. ، Tzur، M. roblem with on Science ، – 454.

،B.K. “An ot and Multi roblem” ، In

and Its cture Notes ،Springer

350- 359.

،Meng ، Q Capacitated ith Flexible d Depots” ،

Modeling ، 0- 152.

“Model and -Period and roblem with ast Depot of 3, No. (3),

cle routing elivery and

Page 17: Closed Loop Supply Chain Planning W ith Vehicle Routingijiepr.iust.ac.ir/article-1-703-en.pdf · za Rashidi Komij evised 10 Febru ustrial Engineer trial Engin Septemb htt ain Pla

Closed Loop

pickuVol.

[32]. Chen

problpickuRese587.

[33]. Deth

logissimuSpec

Follow Th Mirzabaghwith URL: http

p Supply Cha

Internationa

up points”. T23, (1989), p

n ، J. F. ، Wulem with simups. Journaearch Society

hloff ، J. “Vestics: the vehultaneous dectrum ، Vol. 2

his Article at

hi M, Rashidvehicle

p://ijiepr.iust

ain Planning W

al Journal of Ind

Transportatiopp. 377-386.

u ، T. H. Vmultaneous al of the

y ، Vol. 57,،(2

ehicle routinhicle routinglivery and

23, (2001), p

t The Follow

di Komijan Arouting.

.ac.ir/article-

With Vehicle

dustrial Enginee

on Research A

Vehicle routindeliveries an

e Operation2006), pp. 57

ng and reverg problem wi

pick-up” .Opp.79-96.

wing Site

A, Sarfaraz AIJIEPR.

-1-703-en.htm

……

ering & Producti

A ،

ng nd nal 79-

rse ith

OR

[

[3

A H. Closed 2016;

ml

M. MirzabaH. Sarfaraz

ion Research, Se

[34]. Nagy ، Gfor the RoutingDeliveriOperatio(2005),

35] Archetti

delivery transport226-234.

loop supply 27 (3

aghi, A. Rashz

eptember 2016, V

G. ، Salhi ، SSingle and M

g Problems ies” ، Euronal Researpp. 126- 141

.c ”worst-vehicle

ation scienc

chain plann) :287-3

hidi Komijan

Vol. 27, No. 3

“HeuristicMultiple Dep

with Pickropean Jorch ، Vol. 11.

-case analysrouting

e ، Vol. 40;

ning 303

303*& A.

c Algorithm pot Vehiclek up and

ournal of 62, No. 1,

sis for split problem”. ،(2006), pp.