بهبود جریان جمع آوری در یک شبکه عمومی پستی با ملاحظات تعهدات قراردادی

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.