Show simple item record

AuthorBen-Ayed, Omar
AuthorHamzaoui, Salem
AuthorZalila, Faiza
AuthorAouni, Belaid
Available date2023-12-28T09:32:57Z
Publication Date2014-11-04
Publication NameINFOR
Identifierhttp://dx.doi.org/10.3138/infor.52.4.174
CitationBen-Ayed, O., Hamzaoui, S., Zalila, F., & Aouni, B. (2014). Parcel distribution timetabling problem with incomplete hub network. INFOR: Information Systems and Operational Research, 52(4), 174-184.
ISSN0315-5986
URIhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84962023040&origin=inward
URIhttp://hdl.handle.net/10576/50659
AbstractThe aim of parcel distribution timetabling problem is to optimize the movements of the parcels in their journey from their pickup to their delivery. The minimization of the time spent in this journey is a common objective for this problem. This paper provides a comprehensive presentation of this problem emphasizing its practical aspects. We develop a general mixed integer programming formulation that addresses the common case of incomplete hub network where the volume between two hubs is not large enough to justify the use of a dedicated transport. The developed model is illustrated through a real-world case. The obtained solution includes a decrease in the average time spent by the parcels (from pickup to delivery) by 19% in comparison to the existing practiced parcel schedule.
SponsorThis paper was sponsored and fully supported by the Chairman of GSP.
Languageen
PublisherTaylor & Francis
SubjectIncomplete hub network
Periodic scheduling
Service network design
Timetabling
Transit hub
Transportation
TitleParcel distribution timetabling problem with incomplete hub network
TypeArticle
Pagination174-184
Issue Number4
Volume Number52
ESSN1916-0615
dc.accessType Full Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record