The design of courier transportation networks with a nonlinear zero-one programming model

TL;DR

This paper introduces a nonlinear zero-one integer programming model for designing courier transportation networks, aiming to minimize total costs while considering transportation modes, carrier types, and capacity constraints.

Contribution

It formulates a novel combinatorial optimization model for courier network design that incorporates multiple cost factors and operational constraints.

Findings

Model effectively minimizes total transportation costs.

Incorporates transportation modes and carrier types into the optimization.

Addresses capacity and delivery time constraints explicitly.

Abstract

The courier industry is one of the most essential parts of the modern logistics. Meanwhile, the courier transportation network is one of the most important infrastructures of courier enterprises to take participate into operation. This paper presents a combinatorial optimization model for the courier transportation network design problem, and the aim of network optimization is to determine the transportation organization mode for each courier flow. A nonlinear zero-one integer programming model is formulated to describe the problem, the objective function of the model is intended to minimize the total cost including the accumulation cost, the transportation cost and the transfer cost. Also, we take transportation modes and types of transport carriers into account in the objective function. The constraints of the combinatorial optimization model contain capacities of transfer and sorting centers and delivery dates predefined.