The Weber problem in congested regions with entry and exit points

DOI10.1016/J.COR.2014.10.014zbMATH Open1348.90417OpenAlexW2063063561MaRDI QIDQ337649FDOQ337649

Authors: Mohammad Saleh Farham, Haldun Süral, Cem Iyigun 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.10.014

Recommendations

• Weber problems with mixed distances and regional demand
• Congested traffic dynamics, weak flows and very degenerate elliptic equations
• Congested traffic dynamics, weak flows and very degenerate elliptic equations
• The Riemann problem at a junction for a phase transition traffic model
• Well-posedness of a parametric traffic network problem
• An optimization problem for mass transportation with congested dynamics
• A continuous theory of traffic congestion and Wardrop equilibria
• The generalized Weber problem with expected distances
• Congested traffic equilibria and degenerate anisotropic PDEs
• Optimal Transportation with Traffic Congestion and Wardrop Equilibria

zbMATH Keywords

evolutionary algorithmWeber problemcongested regionsrestricted facility location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• An efficient solution method for Weber problems with barriers based on genetic algorithms
• Title not available (Why is that?)
• Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
• An efficient algorithm for facility location in the presence of forbidden regions
• Planar weber location problems with line barriers
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Title not available (Why is that?)
• A reduction result for location problems with polyhedral barriers
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions

Cited In (2)

• Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
• Generalization of the restricted planar location problems: unified metaheuristic algorithms

This page was built for publication: The Weber problem in congested regions with entry and exit points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337649)