Heterogeneous instant delivery orders scheduling and routing problem

Lu Zhen, Jingwen Wu, Gilbert Laporte, Zheyi Tan

Research output: Contribution to journalArticlepeer-review

6 Citations (SciVal)


Scheduling a large number of time-sensitive orders of multiple types in a short time period is a major challenge for instant delivery platforms. This study introduces an integrated problem of heterogeneous order assignment and routing optimization in the real-world setting of third-party instant delivery platforms. A mixed integer programming model is presented to optimize the assignment of instant delivery orders of multiple types and the scheduling of couriers with different grades. We develop a column generation model and a heuristic solution procedure to yield a solution for the integrated problem and we design an exact sub-procedure to accelerate the pricing problem. Taking Songjiang District, Shanghai as an example, numerical experiments are performed to evaluate the effectiveness of the proposed model and the efficiency of the proposed algorithm. The results show that the algorithm can obtain near-optimal solutions within a reasonable computing time. Several managerial implications are obtained from sensitivity analysis. The proposed methodology can be recommended for platform operators to improve dispatch efficiency and optimize workforce resources.
Original languageEnglish
Article number106246
Number of pages14
JournalComputers and Operations Research
Early online date7 Jun 2023
Publication statusPublished - 1 Sept 2023

Bibliographical note

This research was supported by the National Natural Science Foundation of China (Grant numbers 72361137001, 72025103 and 71831008).

Data availability:
Data will be made available on request.


Dive into the research topics of 'Heterogeneous instant delivery orders scheduling and routing problem'. Together they form a unique fingerprint.

Cite this