Solving Multiobjective Bilevel Transportation-Distribution Planning Problem by Modified NSGA II

Author

Liping Jia ; Xinlei Feng ; Guocheng Zou

Author_Institution

Coll. of Math. & Inf. Sci., Leshan Normal Univ., Leshan, China

fYear

2013

fDate

14-15 Dec. 2013

Firstpage

303

Lastpage

307

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.

Keywords

genetic algorithms; goods distribution; mathematical programming; planning; production planning; transportation; controlled elitism; distributing company; dynamic crowding distance; hybrid algorithm; management science; manufacturing company; modified NSGA II; multiobjective bilevel transportation-distribution planning problem; Companies; Heuristic algorithms; Lead; Manufacturing; Planning; Sociology; Transportation; SBX crossover; bilevel multiobjective transportation-distribution planning problem; modified NSGA II; polynomial mutation;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security (CIS), 2013 9th International Conference on

Conference_Location

Leshan

Print_ISBN

978-1-4799-2548-3

Type

conf

DOI

10.1109/CIS.2013.71

Filename

6746407