EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A New Bounding Procedure for Transportation Problems with Stepwise Costs

Jingyi Liu

Mathematics · 19.11.2025 · 13 (22) · 3709

DOI: 10.3390/math13223709 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 19.11.2025. Verfasst von Jingyi Liu. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Liaoning Provincial Science and Technology Plan—Joint Program of Key Research and Development Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Transportation planning often involves not only shipment costs but also setup costs associated with deploying vehicles or transport resources. In many practical logistics operations, this setup cost does not remain constant but increases stepwise with the number of vehicles used, reflecting economies of scale and scheduling thresholds. To capture this realistic feature, this study investigates the transportation problem with stepwise costs, where total costs combine shipment-dependent variable costs and vehicle activation costs. We develop a mixed-integer programming (MIP) model to represent the problem and propose an efficient algorithm based on variable-splitting reformulation and a row-and-column generation scheme. This approach dynamically introduces only the necessary variables and constraints, enabling the solution of large-scale instances that are otherwise computationally challenging. Numerical experiments show that the method produces high-quality solutions much faster than direct MIP solvers. The results highlight the model’s practical value in optimizing fleet utilization and transportation cost structures in real logistics and supply chain systems.

Förderung

  • Liaoning Provincial Science and Technology Plan—Joint Program of Key Research and Development Project

Zitieren

APA

Liu, J. (2025). A New Bounding Procedure for Transportation Problems with Stepwise Costs. Mathematics, 13(22), 3709. https://doi.org/10.3390/math13223709

Vancouver

Liu J. A New Bounding Procedure for Transportation Problems with Stepwise Costs. Mathematics. 2025;13(22):3709. doi:10.3390/math13223709

BibTeX
@article{Liu2025,
  author = {Liu, Jingyi},
  title = {A New Bounding Procedure for Transportation Problems with Stepwise Costs},
  journal = {Mathematics},
  year = {2025},
  volume = {13},
  number = {22},
  pages = {3709},
  doi = {10.3390/math13223709}
}
Kostenlos starten →