Improving collection flows in a public postal network with contractor's obligation considerations

Iman Niroomand and Aaron Luntala Nsakanda

International Journal of Production Economics, 2018, vol. 198, issue C, 79-92

Abstract: We examine a problem that arises in the postal industry of developing goods collection routes that are subjected to a bidding process where the price is positively correlated to routes operating complexities. The route complexity would delay the arrival of goods to distribution centers and prevent their deliveries to processing plants within the required time windows. We formulate the problem as a variant of the multiple depot vehicle routing problem with time windows. The ant colony optimization algorithm is discussed as a solution methodology and evaluated in a case study that involves a real-life problem faced by a public postal service organization.

Keywords: Postal last mile collection problem; Multiple depot vehicle routing problem with time windows; Ant colony optimization; Metaheuristics (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527318300550
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:198:y:2018:i:c:p:79-92

DOI: 10.1016/j.ijpe.2018.01.025

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().