In this paper, an innovative Genetic Algorithms (GA)
-
based inexact non-linear
programming (GAINLP) problem solving approach has been proposed for solving non-linear programming optimization problems with inexact information (inexact non-linear operation programming). GAINLP was developed based on a GA-
based inexact quadratic solving method. The Genetic Algorithm Solver of the Global Optimization Toolbox (GASGOT) developed by MATLABTM
was adopted as the implementation environment of this study. GAINLP was applied to a municipality solid waste management case. The results from different scenarios indicated that the proposed GA-based heuristic optimization approach
was
able to
generate a solution for a complicated nonlinear problem, which also involve
d
uncertainty.
Municipal solid waste management involves activities such as waste collection, transportation, treatment, reutilization, and disposal. Economic optimization in the operation programming of solid waste management was first proposed in the 1960s [1] . Different models of waste planning have been researched and applied in various engineering fields in the following decades. The primary considerations involved are cost control, environmental sustainability and waste reutilization. The techniques employed include linear programming [2] [3] [4] [5] , mixed integer linear programming [6] , multi-objective programming [7] [8] [9] , nonlinear programming [10] [11] , as well as their hybrids, which involve probability, fuzzy set and inexact analysis [12] [13] [14] [15] [16] . Due to complexity of the problem, research reports on nonlinear programming problems for solid waste management are scarce; some exceptions are [17] [18] . In some of the works such as [10] [11] , the nonlinear objective functions are converted into linear functions or simplified into quadratic functions under some adopted conditions and assumptions.
The approach of operational programming with inexact analysis often treats the uncertain parameters as intervals with known lower and upper bounds and unclear distributions. A major advantage of inexact programming is that the variation in system performance and decision variables can be investigated by solving relatively simple sub-models. In real-life problems, while the available information is often inadequate and the distribution functions are often unknown, it is generally possible to represent the obtained data with inexact numbers that can be readily used in the inexact programming models. For decision makers, it is usually more feasible to represent uncertain information as inexact data than to specify distributions of fuzzy sets or probability functions. Hence, various kinds of inexact programmings such as inexact linear programming (ILP), inexact quadratic programming (IQP), inexact integer programming (IIP), inexact dynamic programming (IDP) and inexact multi-objective programming (IMOP) have been developed and are well discussed [10] [11] [19] [20] [21] [22] . It can be observed from these studies that applications of inexact models to practical solid waste planning systems are effective.
In [23] , the approach of GA for ILP and IQP is discussed; the comparisons of traditional binary analysis solving methods [8] [21] [22] [24] with GA-based methods indicate that for ILP and IQP, GA can generate better results with less computational complexity.
In the literature, much work on traditional binary analysis for IQP has been done, for example, see [10] [11] [21] [22] . However, traditional binary analysis methods for ILP and IQP involve unavoidable simplifications and assumptions, which often increased the chance for error in the problem solving process and adversely affected the quality of the results. Moreover, a more complex model often increases error in the solution. However, it has been observed that more complex models often produce less optimal results, and studies that focus on inexact nonlinear programming problems are scarce. For example, in [19] , the me- thodology is mainly focused on combining endpoint values of the inexact parameters to form a set of deterministic problems, which will only work for particular monotone functions within a small scale model. Therefore, a more flexible problem solving method for the general INLP is desired.
In this paper, we propose to use GA as the optimization technique for solving complex and non-linear problems in operations research, industrial engineering and management science. The GA method is a suitable optimization approach especially for solving problems that involve non-smooth and multi-modal search spaces. The innovative GA-based inexact non-linear programming (GAINLP) solving approach is useful for solving non-linear programming problems with inexact information, or inexact non-linear operation programming problems.
This paper is organized as follows. Section 2 presents the background of the research, which includes an introduction to the problem of Solid Waste Management (SWM), the concept of economies of scale in SWM, and the concept of GA, and the Genetic Algorithm Non-Linear Solver Engine (GANLP) that is used for implementing the proposed method. Section 3 discusses the methodology of the proposed GA-based methods for solving inexact non-liner problems. Section 4 presents a case study in which the solutions for different scenarios of the INLP problem of solid waste disposal planning are generated.
2. Background2.1. Solid Waste Management and the Concept of Economy of Scale in Solid Waste Management Planning
Solid waste management is the process of removing waste materials from the su- rrounding environment, which involves the collection, separation, storage, pro- cessing, treatment, transport, recovery and disposal of solid waste. Landfill and incineration are two of the most commonly used solid waste disposal methods. The objective of a solid waste management process is to dispose of discarded materials in a timely manner so as to prevent the spread of disease, minimize the likelihood of contamination, and reduce their effects on human health and the environment.
The economy of scale (ES) is a microeconomics term, and it refers to the advantages that enterprises obtain due to their size or scale of operation, with the cost per unit of output generally decreasing as the scale increases and fixed costs are distributed over more units of output. In a solid waste management system, ES exists within the transportation process [25] and it can be expressed as a sizing model with a power law [11] .
where is a waste flow decision variable; is a reference waste flow; is the transportation unit cost due to the ES of waste flow; is a coefficient reflecting the significance of the economy of scale to the unit cost of waste transportation for reference waste flow,; and m is an economy of scale exponent which reflects the unit cost decline with respect to the waste flow,
Thus the cost function for waste transportation can be expressed as,
where is the transportation cost due to the variable, is a fixed unit charge, and is the unit transportation cost. The unit transportation cost affected by ES is shown in Figure 1.
By introducing ES into a large-scale solid waste management model, the tran- sportation procedure can be simulated more accurately. At the same time, the incorporation of ES adds a nonlinear factor into the objective function, and hence, more computational effort for problem solving will be required. Within this con- text, we propose GA as a good problem solving method for this type of problems.
Unit transportation cost affected by ES
In the next section, the concept of GA is introduced.
2.2. GA for Solving Non-Linear Problems (GANLP)2.2.1. GA for Deterministic Optimization Problems
A generic procedure of GA can be summarized as follows:
1) Initialization: The initialization step involves establishing the mapping mode between the genotype and phenotype; this can be done by determining the coding and decoding functions, creating the fitness function according to the objective of the problem domain, and generating the initial population with a size of. In GA, the term genotype refers to a candidate solution for a problem, which is often encoded as a bit string, while the phenotype is a domain solution itself and is encoded to be a genotype [26] . This process can be carried out randomly or can be guided by domain information.
2) Evaluation: This step involves calculating the fitness value of each individual in the population.
3) Selection: This step involves applying a selection operator to the population.
4) Elitism: This step involves selecting and preserving the elitist individual in the population.
5) Crossover: This step involves applying a crossover operator to the population.
6) Mutation: This step involves applying a mutation operator to the population and creating the next generation’s population.
7) Termination test: This step involves checking whether a satisfactory solution has been found, or the preset termination condition is met; if one of the condition is true, the algorithm is terminated. Otherwise, the procedure loops back to step (2).
This generic procedure of GA is illustrated as a flowchart in Figure 2.
A variety of implementations of GA have been researched and developed during the past few decades, and many of them are recognized as applicable and
Flowchart of procedure of GA
efficient for engineering applications. Among these implementations, the Genetic Algorithm Solver of the Global Optimization Toolbox (GASGOT) implements a simulated evolution in the MatlabTM (Trademark of MathWord) environment by using both binary and floating-point representations. GASGOT was developed by the Department of Industrial Engineering of North Carolina State University. This implementation provides a flexible platform of genetic operators, selection functions, termination functions, and the evaluation [27] . GASGOT runs in the MatlabTM workspace and can be easily invoked by other programs.
GASGOT supports both binary and floating-point representations, and the corresponding genetic operators have been developed. This study adopts GASGOT as the implementation tool of GA, and the applications and numeric examples were calculated in MatlabTM based on the GA non-linear program (GANLP) solver engine of GASGOT.
2.2.2. GA for Problem Solving of Non-Linear Problems (GANLP)
A general non-linear programming problem (NLP) can be expressed as follows [28] :
[28] indicated that some specially formed non-linear programming problems can be solved by calculus-based algorithms, which assume that the objective function and all non-linear constraints are twice continuously differentiable functions of. Most calculus-based methods aim to transform the non- linear problem into a sequence of solvable sub-problems. The methods generally require explicit or implicit second derivative calculations of the objective function, which in some of the methods can be ill-conditioned and can cause the algorithm to fail [29] . This weakness in the calculus-based method has prompted many researchers to propose GA, which is a random search method, for solving non-linear programming problems [30] [31] .
The following example is taken from [28] :
This problem, similar to many NLPs, can be formulated as follows:
Since the decision variables appear separate in terms of the objective function and the constraints, NLPs of this form are called separable programming problems. This kind of NLP can be solved by approximating each and using a piecewise linear function [28] .
The approximating problem for the above example Equation (4) gives the result, while the actual optimal solution is
A GA program for the above example has been constructed with the parameters specified in Table 1.
The result given by the GA program is:, ,. The evolution curve is shown as Figure 3. Compared to the results generated using the calculus-based method of [28] , the GA generated results are closer to the actual optimal solution.
In Figure 3, it can be seen that at approximately the 15th generation, the optimal solution was generated. Although the fitness of the initial population shown in Figure 4 is not excellent, compared to the separable programming technique described in [28] , the methods implemented in the GA non-linear problem solution engine of GASGOT are demonstrated to be straightforward, universal, efficient, and are feasible approaches for solving non-linear programming problems.
Parameters of genetic algorithms
Representation scheme
Floating-point representation
Selection operator
Normalized geometric ranking selection with rate 0.08, Elitism strategy
Crossover operator
Heuristic crossover, arithmetic crossover
Population size
100
Termination condition
Maximum generations 50
Evolution curve
Fitness of initial population
3. GA for Problem Solving of Inexact Non-Linear Problems (GAINLP)
Quadratic programming problems are specific cases of non-linear programming problems [23] . Due to the lack of generally applicable algorithms for handling the non-linear structure, and the inexact information embedded in the structure, most non-linear programming problems are difficult to solve. The engine for solving interactive binary analysis based inexact linear problems proposed in [21] [22] is not intended for dealing with generic non-linear problems. By contrast, GA can be used as a general problem solver for this type of problems because there is not much difference for GA between treating the term of in quadratic programming problems and the terms or in generic non-linear programming problems.
[23] has proposed a method for solving the IQP problem, which can be modified to solve generic inexact non-linear programming problems. The GA-based inexact non-linear programming method GAINLP involves three stages of problem solving. In the following, a computation experiment will be conducted to illustrate how the GAINLP method can handle complicated inexact non-linear problems Equation (6).
where are inexact parameters and is an inexact variable, for an inexact number, and are the upper and lower bounds, respectively. In this experiment,
GAINLP has been designed to include three stages of problem solving.
In stage one, to obtain the initial suboptimal, the random numbers of were selected to transfer this INLP problem to a NLP problem, such that satisfy the continuous uniform distribution in the intervals of and.
Then, the heuristic search algorithm of the GANLP solver engine, presented in Section 2.2, can be used to identify a suboptimal solution, and the corresponding decision variable. The objective function in Equation (7) was used as the positive term of the fitness function and the constraints of Equation (6) adopted as the negative punishment terms. The result is:
In stage two, by substituting into Equation (6), the inexact coefficients of will be determined. There are two kinds of decision schemes for inexact programming problems, the conservative scheme and optimistic scheme [20] . The former assumes less risk than the latter, so that for a maximization objective function, planning for the lower bound of an objective value represents the conservative scheme, and planning for the upper bound of an objective value represents the optimistic scheme [20] . In terms of constraints, the conservative scheme involves more rigorous or stringent constraints, and the optimistic scheme adopts more tolerant ones.
The obtained in stage one are used to construct two optimization pro- blems in order to determine the coefficients of and respectively. The coefficients from the first group are considered to be corresponding to the optimistic scheme, while the second group correspond to the conservative scheme. Considering are variables, the following two functions can be constructed:
and
To determine of the optimistic scheme in correspondence with the upper limit of the objective value, the objective function can be constructed as follows:
and
The objective functions to get of the conservative scheme are:
and
By solving the above functions Equations (8)-(11), the values of all the inexact coefficients are obtained, such that,
;
.
In stage three, the objective function presented in Equation (7) is converted into the following two sub-problems:
and
In this stage, the inexact parameters in Equation (7) have been eliminated, and two typical non-linear optimization problems have been generated instead. Solving the above two objective functions by GANLP, the solution of the example Equation (6) is:
, , and
As demonstrated above, it can be seen that the GAINLP method can generate the optimal result without any simplification or assumption, and it can be adapted for applications of optimization problems with uncertainty. In the next section, this method will be applied on a real world regional waste management problem.
4. Case Study
The study region includes three municipalities, a waste-to-energy (WTE) facility and a landfill, as shown in Figure 5. Three time periods are considered; each has an interval of five years. Over the 15 year planning horizon, an existing landfill and WTE facilities are available to serve the municipal solid waste (MSW) disposal needs in the region. The landfill has an existing capacity of and the WTE facility has a capacity of The WTE facility generates residues of approximately (on a mass basis) of the incoming waste streams, and its revenue from energy sale is combusted.
Table 2 shows the waste generation rates of the three municipalities and the operating costs of the two facilities in the three periods.
Taking into consideration the effects of the ES, the inexact non-linear (INLP) model can be formulated as follows:
Case study of municipalities and waste management facilities.
Data for the waste generation and treatment/disposal
Time Period
Waste generation
Municipality
[260, 340]
[310, 390]
[360, 440]
Municipality
[160, 240]
[185, 265]
[210, 290]
Municipality
[260, 340]
[260, 340]
[310, 390]
Operation cost
Landfill ()
[30, 45]
[40, 60]
[50, 80]
WTE Facility ()
[55, 75]
[60, 85]
[65, 95]
where, i is the type of waste management facility (, where for landfill, 2 for WTE); is the city,; is the time period,; is the length of period, (day); is the operating cost of facility during period; is the revenue from WTE during period ($/t),; is the capacity of WTE (t/d); is the capacity of the landfill (t); is the waste disposal demand in city during period; is the waste flow from city to facility during period.
In this objective function Equation (12), the first term on the right side reflects the transportation costs in each management period (k = 1 to 3) from each city to each waste treatment unit, and the related operation costs. The second term reflects the cost incurred in transporting the products from the WTE facility to the landfill, and the operation cost at the landfill. The third term is the revenue generated from the WTE facility.
The MSW generation rates generally vary between different municipalities and for different periods, and the costs for the waste transportation and treatment also vary temporally and spatially. Furthermore, interactions exist between the waste flows and their transportation costs due to the effects of the ES. Tables 3-5 show the parameters related to the economy of scale, which include the fixed unit transportation cost Are, the reference waste flow and the coefficient corresponding to.
Hence, it can be observed that the traditional methods of binary analysis cannot solve this problem without additional assumptions or simplifications. The following discussion will explain how traditional methods solve this problem by simplifying the non-linear effects of the ES.
Scenario (i) Letting the effects of the ES are totally ignored. This converts the inexact non-linear programming (INLP) problem to an inexact linear programming (ILP) problem, and the GAILP method presented in [23] can solve the problem.
Scenario (ii) Assuming, it is indicated that the non-linear relationships in Equation (12) can be approximated by grey quadratic functions within a predetermined degree of error. Thus, the non-linear programming
Fixed unit transportation costs
City-to-landfill fixed unit transportation cost
[14.58, 19.40]
[16.04, 21.34]
[17.64, 23.48]
[12.65, 16.87]
[13.92, 18.56]
[15.31, 20.41]
[15.30, 20.49]
[16.83, 22.53]
[18.52, 24.79]
City-to-WTE fixed unit transportation cost
[11.57, 15.42]
[12.73, 16.97]
[14.00, 18.66]
[12.17, 16.15]
[13.39, 17.76]
[14.73, 19.54]
[10.60, 14.10]
[11.67, 15.51]
[12.83, 17.06]
WTE-to-landfill fixed unit transportation cost
[5.71, 7.62]
[6.28, 8.38]
[6.91, 9.33]
Reference waste flow
City-to-landfill reference waste flow
[220, 250]
[240, 280]
[260, 320]
[160, 200]
[180, 220]
[220, 260]
[160, 200]
[180, 240]
[200, 240]
City-to-WTEreference waste flow
[200, 240]
[240, 280]
[280, 320]
[120, 170]
[150, 190]
[180, 220]
[220, 270]
[220, 270]
[240, 270]
WTE-to-landfill reference waste flow
[170, 200]
[200, 260]
[240, 270]
<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x159.png" xlink:type="simple"/></inline-formula>The coefficient representing the economy of scale corresponding to reference waste flow<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x159.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x160.png" xlink:type="simple"/></inline-formula>
−2.7
−3.4
−3.8
−1.9
−2.6
−3.3
−4.1
−5.0
−6.3
−3.1
−4.0
−5.0
−1.7
−2.1
−2.8
−1.2
−1.7
−2.2
−2.8
−3.4
−4.5
−2.3
−2.8
−3.6
−2.1
−2.5
−3.1
−2.0
−2.2
−2.6
−3.4
−4.5
−5.0
−3.2
−3.5
−3.9
−0.8
−1.1
−1.4
−1.3
−1.8
−2.1
Note: The + and ?superscript sign of represents the value of relevant to the upper and lower bound of only.
problem is converted into an inexact quadratic programming problem.
Table 6 lists the solutions of the objective function Equation (12) for above two scenarios (i) and (ii).
Both of the above simplifications introduced inaccuracy and limitations. When the value of m deviates away from the predetermined value, this inaccuracy will increase dramatically.
Applying the GAINLP model on the inexact non-linear programming problem, the optimization problem represented in Equation (12) can be solved directly without additional assumptions for the effects of the ES. By adopting this approach, the solution can be found even when the ES exponent m is not within the interval of.
Three different scenarios, have been tested, and the solutions given by the GAINLP model are shown in Table 7.
The above scenarios assume that the economy of scale exponent is universal in the whole region during the entire period. However, this is not always necessarily true for practical engineering problems. More common situations may involve different scale exponents for various combinations of municipalities and facilities in different periods. Thus, Table 8 illustrates the solutions for the fourth scenario, which involves different scale exponents.
In the objective function of the inexact non-linear programming model Equation (12), the weight of the transportation cost in the system operation cost varies according to different values. The effect becomes significant when waste
Solutions obtained by applying the ILP model (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x187.png" xlink:type="simple"/></inline-formula>) and IQP model (<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x187.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x188.png" xlink:type="simple"/></inline-formula>)
Decision Variable
Facility
Municipality
Period
ILP Solution (t/d)
IQP Solution (t/d)
1
1
1
[210, 290]
[250, 290]
1
1
2
0
[310, 350]
1
1
3
[0, 30]
[360, 440]
1
2
1
0
[0, 30]
1
2
2
[0, 65]
[185, 225]
1
2
3
[210, 290]
[50, 80]
1
3
1
[0, 30]
0
1
3
2
[260, 330]
0
1
3
3
[170, 200]
0
2
1
1
50
[10, 50]
2
1
2
[310, 390]
[0, 40]
2
1
3
[360, 410]
0
2
2
1
[160, 240]
[160, 210]
2
2
2
[185, 200]
[0, 40]
2
2
3
0
[160, 210]
2
3
1
[260, 310]
[260, 340]
2
3
2
[0, 10]
[260, 340]
2
3
3
[140, 190]
[310, 390]
System cost ()
[220.2, 507.4]
[239.5, 514.1]
Note: Facility: 1 = landfill, 2 = WTC Facility.
Solutions when<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x211.png" xlink:type="simple"/></inline-formula>, 0.3 and 0.5
Decision Variable
Facility
Munici-pality
Period
Solution
(t/d)
1
1
1
[203, 292]
[100, 221]
[35, 88]
1
1
2
[1, 36]
[1, 44]
[1, 36]
1
1
3
[1, 44]
[126, 190]
[240, 300]
1
2
1
[1, 43]
[60, 141]
[144, 240]
1
2
2
[1, 73]
[20, 103]
[75, 148]
1
2
3
[200, 290]
[200, 259]
[197, 260]
1
3
1
[1, 37]
[90, 190]
[225, 312]
1
3
2
[247, 332]
[189, 270]
[120, 200]
1
3
3
[154, 209]
[139, 210]
[143, 192]
2
1
1
[35, 58]
[120, 167]
[220, 307]
2
1
2
[295, 390]
[299, 385]
[295, 390]
2
1
3
[329, 426]
[202, 323]
[120, 161]
2
2
1
[147, 240]
[55, 145]
[1, 30]
2
2
2
[165, 222]
[142, 200]
[80, 154]
2
2
3
[1, 25]
[1, 40]
[1, 43]
2
3
1
[230, 320]
[122, 164]
[12, 40]
2
3
2
[1, 28]
[30, 100]
[108, 167]
2
3
3
[125, 200]
[125, 194]
[120, 214]
System cost ()
=
[209.8, 522.3]
[200.5, 519.6]
[197.6, 516.8]
Note: Facility: 1 = landfill, 2 = WTC Facility.
flow becomes lower and the hauling distances are substantial. This effect is a non- linear function of the waste flow, in which the reference waste flow and the economy of scale exponent m are the parameters. Thus, the problem is a complicated non-linear programming problem, and the GA-based search approach has been shown to be adequate for solving this kind of economy optimization problems.
It is also reasonable to assume that between different locations (), for different time periods (), the economy of scale exponent (and) may be different, since m is the parameter used to describe the characteristics and attributes of a particular transportation scenario. Under these considerations, scenario 4 was designed with different operation costs and transportation strategies. On the other hand, the traditional inexact linear and inexact quadratic programming methods will not be able to handle situations like scenario 4 without additional assumptions and simplification.
The results also show that when the value of the economy of scale exponent becomes smaller, from −0.1, −0.3 to −0.5, for both positive scheme and negative scheme, the value of the minimized objective function also becomes
Solutions when <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-6703156x244.png" xlink:type="simple"/></inline-formula> is different for each municipality and each period
Symbol
Facility
Municipality
Period
Solution
m
Decision Variable (t/d)
landfill
1
1
[100, 192]
−0.15
landfill
1
2
[0, 40]
−0.2
landfill
1
3
[112, 178]
−0.35
landfill
2
1
[65, 139]
−0.2
landfill
2
2
[40, 78]
−0.3
landfill
2
3
[199, 279]
−0.3
landfill
3
1
[90, 189]
−0.25
landfill
3
2
[135, 280]
−0.25
landfill
3
3
[127, 218]
−0.3
WTC Facility
1
1
[125, 189]
−0.1
WTC Facility
1
2
[300, 390]
−0.15
WTC Facility
1
3
[205, 312]
−0.15
WTC Facility
2
1
[42, 142]
−0.45
WTC Facility
2
2
[129, 192]
−0.3
WTC Facility
2
3
[0, 40]
−0.1
WTC Facility
3
1
[100, 198]
−0.3
WTC Facility
3
2
[44, 113]
−0.45
WTC Facility
3
3
[99, 219]
−0.4
System cost ()
=
[194.7, 500.1]
Note: for transportation from WTE facility to landfill, m = −0.5.
smaller. At the same time, the range of the intervals of the minimized objective function also decreases. This reflects how the economy of scale exponent affects the overall cost for the entire period. A comparison of the results for the four scenarios is given in Figure 6.
5. Conclusion
This paper has proposed an innovative GA-based inexact non-linear programming problem solving approach (GAINLP). The GAINLP was applied to a solid waste management optimization problem, under different scenarios, and the results from the GAINLP, GAILP, and GAIQP methods were compared. The com- parison illustrates the practicality and flexibility of the proposed GAINLP method for solving more complex inexact non-linear problems. Similar to other all- purpose heuristic search methods, this problem solving approach is widely adap- table for different problem scenarios that involve non-linear optimization and inexact information. The GAINLP method was implemented in Matlab, and it can be integrated with other operation programming software packages. The implementation of GAINLP can also be easily extended to include other non-linear pro- gramming solvers so as to enhance the flexibility and efficiency of the problem solving process.
System cost comparisons
Acknowledgements
The generous support of the Natural Sciences and Engineering Research Council (NSERC) and the Canada Research Chair Program of Canada are gratefully acknowledged.
Cite this paper
Jin, W.H., Hu, Z.Y. and Chan, C. (2017) An Innovative Genetic Algorithms-Based Inexact Non-Li- near Programming Problem Solving Method. Journal of Environmental Protection, 8, 231-249. https://doi.org/10.4236/jep.2017.83018
ReferencesAnderson, L. (1968) A Mathematical Model for the Optimization of a Waste Management System. Technical Report 68-1, Sanitary Engineering Research Laboratory, University of California, Berkely.Christensen, H. and Haddix, G. (1974) A Model for Sanitary Landfill Management and Decision. Computers and Operation Research, 1, 275-281. https://doi.org/10.1016/0305-0548(74)90052-5Fuertes, L., Hundson, J. and Mark, D. (1974) Solid Waste Management: Equity Trade-Off Models. Journal of Urban Planning and Development, 100, 155-171.Jenkins, L. (1982) Parametric Mixed Integer Programming: An Application to Solid Waste Management. Management Science, 28, 1271-1284. https://doi.org/10.1287/mnsc.28.11.1270Jacobs, T. and Everett, J. (1992) Optimal Scheduling of Landfill Operations Incorporating Recycling. Journal of Environmental Engineering, 118, 420-429. https://doi.org/10.1061/(ASCE)0733-9372(1992)118:3(420)Badran, M. and El-Haggar, S. (2006) Optimization of Municipal Solid Waste Management in Port Said-Egypt. Waste Management, 26, 534-545. https://doi.org/10.1016/j.wasman.2005.05.005Sushi, A. and Vart, P. (1989) Waste Management Policy Analysis and Growth Monitoring: An Integrated Approach to Perspective Planning. International Journal of Systems Science, 20, 907-926. https://doi.org/10.1080/00207728908910180Chang, N. (1996) A Grey Fuzzy Multiobjective Programming Approach for the Optimal Planning of a Reservoir Watershed, Part A: Theoretical Development. Water Research, 30, 2329-2340. https://doi.org/10.1016/0043-1354(96)00124-8Chang, N., Shoemaker, C. and Schuler, R. (1996) Solid Waste Management System Analysis with Air Pollution and Leachate Impact Limitations. Waste Management and Research, 14, 463-481. https://doi.org/10.1177/0734242X9601400505Huang, G., Baetz, B. and Patry, G. (1995) Grey Integer Programming: An Application to Waste Management Planning under Uncertainty. European Journal of Operational Research, 83, 594-620. https://doi.org/10.1016/0377-2217(94)00093-RHuang, G., Baetz, B. and Patry, G. (1995) Grey Quadratic Programming and Its Application to Municipal Waste Management Planning under Uncertainty. Engineering Optimization, 23, 201-223. https://doi.org/10.1080/03052159508941354Li, Y. and Huang, G. (2009) Dynamic Analysis for Solid Waste Management Systems: An Inexact Multistage Integer Programming Approach. Journal of the Air and Waste Management Association, 59, 279-292. https://doi.org/10.3155/1047-3289.59.3.279Huang, G. and Cai, Y. (2010) A Superiority-Inferiority-Based Inexact Fuzzy Stochastic Programming Approach for Solid Waste Management under Uncertainty. Environmental Modeling and Assessment, 15, 381-396. https://doi.org/10.1007/s10666-009-9214-6Ekmekçioglu, M., Kaya, T. and Kahraman, C. (2010) Fuzzy Multicriteria Disposal Method and Site Selection for Municipal Solid Waste. Waste Management, 30, 1729-1737. https://doi.org/10.1016/j.wasman.2010.02.031Piresa, A., Martinho, G. and Chang, N. (2001) Solid Waste Management in European Countries: A Review of Systems Analysis Techniques. Journal of Environmental Management, 92, 1033-1050. https://doi.org/10.1016/j.jenvman.2010.11.024Beliën, J., De Boeck, L. and Van Ackere, J. (2012) Municipal Solid Waste Collection and Management Problems: A Literature Review. Transportation Science, 48, 78-102. https://doi.org/10.1287/trsc.1120.0448Or, I. and Curi, K. (1993) Improving the Efficiency of the Solid Waste Collection System in Izmir, Turkey, through Mathematical Programming. Waste Management & Research, 11, 297-311. https://doi.org/10.1177/0734242X9301100404Sun, W., Huang, G., Lv, Y. and Li, G. (2013) Inexact Joint-Probabilistic Chance-Constrained Programming with Left-Hand-Side Randomness: An Application to Solid Waste Management. European Journal of Operational Research, 228, 217-225. https://doi.org/10.1016/j.ejor.2013.01.011Chang, N., Schuler, R. and Shoemaker, C. (1993) Environment and Economic Optimization of an Integrated Solid Waste Management System. Journal of Resource Management and Technology, 21, 87-100.Huang, G., Baetz, B. and Patry, G. (1993) A Grey Fuzzy Linear Programming Approach for Municipal Solid Waste Management Planning under Uncertainty. Civil Engineering Systems, 10, 123-146. https://doi.org/10.1080/02630259308970119Huang, G., Baetz, B. and Patry, G. (1994) Grey Dynamic Programming for Solid Waste Management Planning Under Uncertainty. Journal of Urban Planning and Development, 120, 132-156. https://doi.org/10.1061/(ASCE)0733-9488(1994)120:3(132)Huang, G., Baetz, B. and Patry, G. (1994) Waste Flow Allocation Planning through a Grey Fuzzy Quadratic Programming Approach. Civil Engineering Systems, 11, 209-243. https://doi.org/10.1080/02630259408970147Jin, W., Hu, Z. and Chan, C. (2013) A Genetic-Algorithms-Based Approach for Programming Linear and Quadratic Optimization Problems with Uncertainty. Mathematical Problems in Engineering, 2013, Article ID: 272491. http://www.hindawi.com/journals/mpe/2013/272491/https://doi.org/10.1155/2013/272491Chen, M. and Huang, G. (2001) A Derivative Algorithm for Inexact Quadratic Program-Application to Environmental Decision-Making under Uncertainty. European Journal of Operational Research, 128, 570-586. https://doi.org/10.1016/S0377-2217(99)00374-4Callan, S. and Thomas. J. (2001) Economies of Scale and Scope: A Cost Analysis of Municipal Solid Waste Services. Land Economics, 77, 548-560. https://doi.org/10.2307/3146940Melanie. M. (1998) An Introduction of Genetic Algorithms, The MIT Press, Cambridge.Houck, C., Joines, J. and Kay, M. (1995) A Genetic Algorithm for Function Optimization: A Matlab Implementation. NCSU-IE TR 95.09.Winston, W. (2003) Operation Research: Applications and Algorithms. Duxbury Press, Boston.Michalewicz, Z. (1998) Genetic Algorithm + Data Structures = Evolution Programs. 3rd Revised and Extended Edition, Springer, Berlin.Gen, M. and Cheng, R. (1997) Genetic Algorithm and Engineering Design. Wiley, New York.Joines, J. and Houck, C. (1994) On the Use of Non-Stationary Penalty Functions to Solve Constrained Optimization Problems with Genetic Algorithms. Proceedings of the 1st IEEE Conference on Evolutionary Computation, Orlando, 27-29 June 1994, 579-584.