A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
type: Item
instance of: scholarly article
title: A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project
zbMATH Open document ID: 1264.90207
DOI: 10.1155/2012/463976
author: Yan Tu
author: Ziqiang Zeng
author: Jiuping Xu
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: The aim of this study is to deal with a minimum cost network flow problem (MCNFP) in a large-scale construction project using a nonlinear multiobjective bilevel model with birandom variables. The main target of the upper level is to minimize both direct and transportation time costs. The target of the lower level is to minimize transportation costs. After an analysis of the birandom variables, an expectation multiobjective bilevel programming model with chance constraints is formulated to incorporate decision makers' preferences. To solve the identified special conditions, an equivalent crisp model is proposed with an additional multiobjective bilevel particle swarm optimization (MOBLPSO) developed to solve the model. The Shuibuya Hydropower Project is used as a real-world example to verify the proposed approach. Results and analysis are presented to highlight the performances of the MOBLPSO, which is very effective and efficient compared to a genetic algorithm and a simulated annealing algorithm.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6173299
describes a project that uses: MOPSO
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/463976
OpenAlex ID: W2127810966
Wikidata QID: Q58911693
cites work: Q4845363
cites work: Q4663414
cites work: Wireless Network Information Flow: A Deterministic Approach
cites work: An exterior simplex type algorithm for the minimum cost network flow problem
cites work: A deterministic annealing algorithm for the minimum concave cost network flow problem
cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
cites work: A new scaling algorithm for the minimum cost network flow problem
cites work: Q4234147
cites work: An algorithm for the biobjective integer minimum cost flow problem
cites work: Minimal-cost network flow problems with variable lower bounds on arc flows
cites work: User equilibrium traffic network assignment with stochastic travel times and late arrival penalty
cites work: A multi-level nonlinear multi-objective decision-making under fuzziness
cites work: Linear bilevel programs with multiple objectives at the upper level
cites work: Bilevel programming: a survey
cites work: A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
cites work: One Type of Optimal Portfolio Selection in Birandom Environments
cites work: Q3292914
cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
cites work: Q5534646
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
cites work: A discrete time optimal control model with uncertainty for dynamic machine allocation problem and its application to manufacturing and construction industries
cites work: A Convergence Proof for the Particle Swarm Optimiser
description: scientific article; zbMATH DE number 6173299