The Weber problem in logistic and services networks under congestion
We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in queueing problems. The location of the center is determined to...
Main Authors: | Vanessa Lange, Hans Daduna |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-01-01
|
Series: | EURO Journal on Computational Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440622000326 |
Similar Items
-
The Inverse Weber Problem on the Plane and the Sphere
by: Franco Rubio-López, et al.
Published: (2023-12-01) -
Gordon and Newell queueing networks and copulas
by: Ciuiu Daniel
Published: (2009-01-01) -
Solving Weber Problem on Plane with Minimax Criterion and Forbidden Gaps
by: G.G. Zabudsky, et al.
Published: (2014-09-01) -
Facility Location Problem Approach for Distributed Drones
by: Jared Lynskey, et al.
Published: (2019-01-01) -
Valuing the Arts
by: Hannah Newell
Published: (2015-11-01)