Show simple item record

dc.contributor.authorJayaswal, Sachin
dc.contributor.authorVidyarthi, Navneet
dc.date.accessioned2023-10-30T04:46:39Z
dc.date.available2023-10-30T04:46:39Z
dc.date.issued2023-02-07
dc.identifier.issn1872-6860
dc.identifier.urihttp://hdl.handle.net/11718/26926
dc.description.abstractIn this paper, we study a hub network design problem arising in the context of a third-party logistics (3PL) service provider, which acts as an intermediary between shippers and carriers. A 3PL service provider usually caters to different classes of shipments that require different levels of service, e.g. two-day delivery, next-day delivery etc. We, therefore, study the problem under stochastic demand from two classes of shipments, with one class receiving priority over the other in service at the hubs to maintain the different service levels required by them. To this end, we present two models for designing a capacitated hub network with a service level constraint, defined using the distribution of time spent at hubs, for each shipment class. The models seek to design the hub network at the minimum total cost, which includes the total fixed cost of equipping open hubs with sufficient processing capacity and the variable transportation costs. The network of hubs, given their locations, is thus modeled as spatially distributed priority queues. The resulting model is challenging to solve, for which we propose a cutting plane-based exact solution method.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofEuropean Journal of Operational Researchen_US
dc.subjectLocationen_US
dc.subjectHub networksen_US
dc.subjectService levelen_US
dc.subjectPriority queueen_US
dc.subjectCutting plane methoden_US
dc.titleMultiple allocation hub location with service level constraints for two shipment classesen_US
dc.typeArticleen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record