An effective bilevel programming approach for the evasive flow capturing location problem
type: Item
instance of: scholarly article
title: An effective bilevel programming approach for the evasive flow capturing location problem
author: F. Hooshmand
author: S. A. MirHassani
published in: Networks and Spatial Economics
publication date: 2020-10-08T00:00:00Z
Mathematics Subject Classification ID: 90-XX
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7257985
zbMATH Keywords: evasive flow capturing problem
zbMATH Keywords: weigh-in-motion
zbMATH Keywords: vehicle inspection stations
zbMATH Keywords: bi-level program
zbMATH Keywords: KKT-based reformulation
zbMATH Keywords: exact decomposition-based algorithm
describes a project that uses: CPLEX
describes a project that uses: AIMMS
MaRDI profile type: Publication
full work available at URL: s11067-018-9415-0
OpenAlex ID: W2887007495
cites work: A link-node discrete-time dynamic second best toll pricing model with a relaxation solution algorithm
cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem
cites work: Q3989989
cites work: Flow intercepting facility location: Problems, models and heuristics
cites work: An overview of bilevel optimization
cites work: Foundations of bilevel programming
cites work: A branch and bound algorithm for bi-level discrete network design problem
cites work: New Branch-and-Bound Rules for Linear Bilevel Programming
cites work: Shortest-path network interdiction
cites work: The polynomial hierarchy and a simple model for competitive analysis
cites work: A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
cites work: Multilevel decision-making: a survey
cites work: Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints
cites work: Evasive flow capture: a multi-period stochastic facility location problem with independent demand
cites work: Lagrangean relaxation-based algorithm for bi-level problems
cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique
cites work: An extended Kuhn-Tucker approach for linear bilevel programming
cites work: Q4649021
cites work: Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
Wikidata QID: Q129428355
DOI: 10.1007/S11067-018-9415-0
Recommended article: Evasive flow capture: a multi-period stochastic facility location problem with independent demand
Recommended article: Bi‐level programming based contra flow optimization for evacuation events
Recommended article: Exact Solution of the Evasive Flow Capturing Problem
Recommended article: Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
Recommended article: Flow intercepting facility location: Problems, models and heuristics
Recommended article: Bilevel programming applied to the flow shop scheduling problem
Recommended article: Bi-level programming model and hybrid genetic algorithm for flow interception problem with customer choice
Recommended article: Pessimistic evasive flow capturing problems
Recommended article: Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning
Recommended article: Efficient solutions for the bicriteria network flow problem
description: scientific article; zbMATH DE number 7257985