Name
Title | ||
|---|---|---|
Solving Multiobjective Bilevel Transportation-Distribution Planning Problem by Modified NSGA II |
Abstract | ||
|---|---|---|
Transportation-distribution planning problems have been one of the important topics in management science. This paper studies a bilevel multiobjective transportation-distribution planning nodel in which the distributing company has two objectives and the manufacturing company has one objective. For the proposed model, we present a hybrid algorithm to solve this problem, the algorithm uses the controlled elitism and the dynamic crowding distance to improve the NSGA-II, and thus a modified NSGA II is given. A practical problem is presented to validate the proposed algorithm. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/CIS.2013.71 | CIS |
Keywords | Field | DocType |
multiobjective bilevel transportation-distribution planning problem,transportation-distribution planning problem,controlled elitism,dynamic crowding distance,polynomial mutation,manufacturing company,sbx crossover,transportation,mathematical programming,bilevel multiobjective transportation-distribution planning,bilevel multiobjective transportation-distribution planning problem,planning,hybrid algorithm,management science,practical problem,production planning,proposed algorithm,distributing company,genetic algorithms,modified nsga ii,goods distribution,multiobjective bilevel transportation-distribution planning | Mathematical optimization,Crowding distance,Hybrid algorithm,Manufacturing,Computer science,Goods distribution,Operations research,Production planning,Genetic algorithm,Elitism | Conference |
ISBN | Citations | PageRank |
978-1-4799-2548-3 | 1 | 0.36 |
References | Authors | |
7 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li-Ping Jia | 1 | 54 | 7.81 |
| Xin-Lei Feng | 2 | 3 | 1.45 |
| Guocheng Zou | 3 | 3 | 1.69 |