A Bi-objective Model for Collaborative Uncapacitated arc Routing Problem Including Coalition Satisfaction

Authors

  • Mostafa Khorramizadeh Shiraz University of Technology
  • Mohammad Sadegh Shiri Department of Mathematics, Islamic Azad University
  • Vahid Ahmadi Shiraz University of Technology
  • Masoud Zarepisheh

Abstract

This paper deals with a carrier collaboration problem in which carriers form a coalition to share and exchange their transportation requests located on the arcs of the network. This problem has recently gained a significant attention to enhance the operational efficiency. However, the existing problem formulations are single objective optimization problems solely focusing on maximizing the profit and overlooking satisfaction criterion which is crucial to the coalition’s long-term survival. This paper proposes a bi-objective integer linear programming model aiming at maximizing profit as well as coalition satisfaction. In order to ensure satisfaction among all members of the coalition, an efficient metric is proposed using proper mathematical norms (L 1 -Norm and L ∞ -Norm) , encouraging a well-distribution of satisfaction among members. Moreover, this paper shows how the carriers’ overtime can be introduced in the problem formulation which could potentially improve the total profitability of the system and coalition satisfaction. The proposed models are tested on a publicly available data set of 1416 instances and the performance of the models are analyzed.

Published

2026-06-16

Issue

Section

Vol. 20, No. 3, (2026)