The Weber problem in logistic and services networks under congestion

Lange, Vanessa; Daduna, Hans

doi:10.1016/j.ejco.2022.100056

Cited by 2 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, congestion and delay may affect service performance and the choice of network structure. Delay problems can be eased by re-designing network structures [34][35][36][37]. Lange et al (2023) considered a location-allocation-routing problem, postulating that queueing problems result from limited capacities, where congestion occurs [36].…”

Section: Literature Reviewmentioning

confidence: 99%

“…Delay problems can be eased by re-designing network structures [34][35][36][37]. Lange et al (2023) considered a location-allocation-routing problem, postulating that queueing problems result from limited capacities, where congestion occurs [36]. Ashish (2018) pointed out that there were many causes of delay, which could be reduced according to the characteristics of the airport [38].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Hub-and-Spoke Network Optimization with Flow Delay Cost: The Case of Goods Delivery on Urban Logistics Networks in Eastern China

Wang,

Shen,

Wang

et al. 2024

Mathematics

View full text Add to dashboard Cite

With respect to a traditional point-to-point (P-P) network, a hub-and-spoke (H-S) network not only uses a smaller number of links/paths but also utilizes the scale economy advantage on consolidated flows on hub–hub links and at hubs. However, the inevitable delays through hubs have always been a critical concern. Therefore, this paper develops an H-S model considering flow delay costs and applies the model to a logistics case in Eastern China. The integer quadratic term in the model’s objective function is linearized using the algebraic method. Our model is applied to develop an H-S network for its 13-node express package delivery operation, using the particle swarm optimization (PSO) algorithm. The results show using the H-S can save more than 14.1% of the total cost annually. The model also provides an applied case to the H-S configuration, especially for urban express delivery logistics in China.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Hub-and-Spoke Network Optimization with Flow Delay Cost: The Case of Goods Delivery on Urban Logistics Networks in Eastern China

Wang,

Shen,

Wang

et al. 2024

Mathematics

View full text Add to dashboard Cite

show abstract

On queueing-inventory-location problems

Daduna

2022

Ann Oper Res

View full text Add to dashboard Cite

A network of queueing-inventory systems is considered where the inventories are replenished by a common central server. Travel times for transport of the items send out from the center and an adaptive dispatching regime to direct transportation towards the locations with queueing-inventory systems are incorporated in the model. The stationary distribution of the system is of product form and is explicitly given. An optimization procedure is developed to find for given locations of the queueing-inventory systems an optimal location for the replenishment center. Optimization is with respect to overall utilization of the resources measured in total throughput of the queueing-inventory systems.

show abstract

The Weber problem in logistic and services networks under congestion

Cited by 2 publications

References 35 publications

Hub-and-Spoke Network Optimization with Flow Delay Cost: The Case of Goods Delivery on Urban Logistics Networks in Eastern China

Hub-and-Spoke Network Optimization with Flow Delay Cost: The Case of Goods Delivery on Urban Logistics Networks in Eastern China

On queueing-inventory-location problems

Contact Info

Product

Resources

About