A class of rough multiple objective programming and its application to solid transportation problem

This paper establishes a rough multiple objective programming model for a solid transportation problem. Furthermore, a general model for rough multiple objective programming problem is presented. Properties of the feasible and efficient solutions of rough multiple objective programming problems are...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 188; s. 215 - 235
Hlavní autoři: Tao, Zhimiao, Xu, Jiuping
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.04.2012
Témata:
Computer simulation
Genetic algorithms
Interactive
Mathematical models
Multiple objective
Multiple objective programming
Programming
Rough sets
Rough simulation-based genetic algorithm
Solid transportation problem
Stations
Transportation problem
Solid transportation problem
Rough sets
Multiple objective programming
Rough simulation-based genetic algorithm
ISSN:0020-0255, 1872-6291
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper establishes a rough multiple objective programming model for a solid transportation problem. Furthermore, a general model for rough multiple objective programming problem is presented. Properties of the feasible and efficient solutions of rough multiple objective programming problems are investigated. In addition, compromise solutions are obtained by using the interactive fuzzy satisfying method. To solve the rough multiple objective solid transportation problem, the rough simulation-based genetic algorithm is proposed, in which the rough simulation is embedded into the genetic algorithm. Finally, an application of the solid transportation problem at Xiluodu Hydropower Station is provided as an illustration.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2011.11.022