Академический Документы
Профессиональный Документы
Культура Документы
Abstract
After providing a brief overview on Europes
legislative situation with regard to the demanded
recovering and recycling of end-of-life vehicles the
paper characterizes the specifications of a modeling
approach describing the design of a recycling
network including a large variety of different
cooperating actors set at diverse positions on a
reverse supply-chain. It advances with a discussion
of requirements a suitable optimization approach
needs to fulfill. Then it proceeds by addressing the
optimization approach that has been chosen and it
concludes by providing results for an ideal network
design.
Introduction
3
4
2.1
(~x , ~y ) Z
n
i =1
dist Z i , F j rd .
for all
s c dist (Z , F ) s
n
ij
=0
can
easily
be
i =1 j =1
determined.
Up to here we considered only those facility
location problems in which a set of alternative
locations are provided and the task is to assign zones
to facilities and vice versa. With regard to the
problem to be solved here it is necessary to extend
the description above inasmuch as both, finding a
concrete position for each facility and determining
the number of facilities to be located, m , become
part of the problem. Thus our specific job consists of
three tasks, namely to determine the number of
facilities to be located, to identify positions for new
facility locations and to assign zones which are
served by these facilities. When m is large this
general problem is NP-hard. Then it becomes
relevant to use approximation algorithms or to
investigate important restricted situations where
polynomial time-algorithms can be applied.
2.2
supply-chain
consisting
of
the
links
ZOF S .
3.1
Decision variables
3.2
Optimization strategy
Real-life evolution
Artificial GA evolution
3.3
3.4
Strategy variables
3.5
Pre-optimization
s c dist (Z , F ) s
n
ij
i =1 j =1
j =1
((s ( ))
n
Fj ( + 1) :=
ij
i =1
Zi
(s ( ))
n
~ . It commences by
, 1 j m
ij
i =1
updating
s ( + 1) ,
i.e.
~
m dist Fj ( + 1), Z i
sij ( + 1) :=
~
j =1 dist F~j ( + 1), Z i
by
2
1
calculating
+
, R . Note
No. of ELVs
20,041
25,434 132,508
712
2,384
8,351
No. of facilities F j
103
157
873
39
References
Experiment 1
Experiment 2
Scenario 1
100%
116%
Scenario 2
100%
134%
Scenario 3
100%
333%
Experiment 1
Experiment 2
Scenario 1
52%
64%
Scenario 2
56%
43%
Scenario 3
51%
1%
Arbeitsgemeinschaft
Altauto,
Erster
Monitoringbericht, 2000.
[2] Baker J.E., Adaptive Selection Methods for Genetic
Algorithms, Proceedings of the First International
Conference on Genetic Algorithms (ICGA'85),
Lawrence Erlbaum Associates, Hilssdale, NJ, 101
111, 1985.
[3] Barricelli N.A., Symbiogenetic evolution processes
realised by artificial methods, Methods, 9 (35-36),
143 183, 1957.
[4] Bergmann A., W. Burgard, A. Hemker, Adjusting
parameters of genetic algorithms by fuzzy control
rules, Proceedings Third International Workshop on
Software Engineering and Expert Systems for High
Energy and Nuclear Physics, New Computing
Techniques in Physics Research III, Oberammergau,
235 240, 1994.
[5] Bezdek, J.C., Pattern Recognition with Fuzzy
Objective Function Algorithms New York, 1981.
[6] Bramlette M.F., Initialization, Mutation and
Selection Methods in Genetic Algorithms for
Function Optimization, Proceedings of the Fourth
International Conference on Genetic Algorithms
(ICGA'91), Morgan Kaufman Publishers, San Mateo,
CA, 100 107, 1991.
[7] Darwin, C., Entstehung der Arten, Vol. 3,
Schweizerbartsche Verlagshandlung und Druckerei,
Stuttgart, 1867.
[8] Davis L., Adapting Operator Probabilities in Genetic
Algorithms, Proceedings of the Third International
Conference on Genetic Algorithms, Schaffer J. (ed.),
Morgan Kaufman Publishers, Los Altos, CA, 61
69, 1989.
[9] Davis, L. (ed.), Handbook of Genetic Algorithms, van
Nostrand Reinhold, New York, 1991.
[10] De Jong K., Genetic Algorithms: A 10 Year
Perspective, Proceedings of the First International
Conference on Genetic Algorithms (ICGA'85),
Lawrence Erlbaum Associates, Hilssdale, NJ, 169
177, 1985..
[11] De Jong, K., W. Spears, On the State of Evolutionary
Computation, Proceedings of the Fifth International
Conference on Genetic Algorithms (ICGA93),
[1]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
[20]
[21]
[22]
[23]
[24]
[25]
[26]
[27]
[28]
[29]
[30]
[31]
[32]
[33]
[34]
[35]
10