Research output: Contribution to conference › Paper › peer-review
A Real-World Parcel Routing Problem: MIP Formulation and Heuristic. / Усков, Андрей Владимирович; Kotezhekova, Valentina.
2024. 264-275 Paper presented at XXIII International Conference Mathematical Optimization Theory and Operations Research, Омск, Russian Federation.Research output: Contribution to conference › Paper › peer-review
}
TY - CONF
T1 - A Real-World Parcel Routing Problem: MIP Formulation and Heuristic
AU - Усков, Андрей Владимирович
AU - Kotezhekova, Valentina
N1 - Conference code: 23
PY - 2024
Y1 - 2024
N2 - In the paper the optimization problem of parcel delivery is considered. This belongs to the family of Multi-Commodity Network Flow Problems (MCNF). The problem is characterized by a significant number of incorporated business requirements (different vehicles types and transport routes, due dates, multiple transit stations, etc.) together with a wide data scope covering thousands of post offices across a country and millions of daily parcels which both lead to a large problem size. The problem is formulated in terms of a Mixed Integer Linear Program with over 3 billion variables and over 800 thousand constraints. A heuristic-based approach in conjunction with the use of a state-of-the-art MIP solver is proposed to solve real-life problem. Computational results demonstrates that the designed heuristic search is able to provide good solutions for large-scale instances of the MCNF in a reasonable time.
AB - In the paper the optimization problem of parcel delivery is considered. This belongs to the family of Multi-Commodity Network Flow Problems (MCNF). The problem is characterized by a significant number of incorporated business requirements (different vehicles types and transport routes, due dates, multiple transit stations, etc.) together with a wide data scope covering thousands of post offices across a country and millions of daily parcels which both lead to a large problem size. The problem is formulated in terms of a Mixed Integer Linear Program with over 3 billion variables and over 800 thousand constraints. A heuristic-based approach in conjunction with the use of a state-of-the-art MIP solver is proposed to solve real-life problem. Computational results demonstrates that the designed heuristic search is able to provide good solutions for large-scale instances of the MCNF in a reasonable time.
U2 - 10.1007/978-3-031-73365-9_18
DO - 10.1007/978-3-031-73365-9_18
M3 - материалы
SP - 264
EP - 275
T2 - 23 International Conference on Mathematical Optimization Theory and Operations Research
Y2 - 30 June 2024 through 6 July 2024
ER -
ID: 129363958