TY - JOUR

T1 - Modeling and Solving the Fuel Distribution Problem with Unloading Precedence and Loading Sequence Considerations

AU - Androutsopoulos, Konstantinos N.

AU - Zografos, K. G.

PY - 2024/1/1

Y1 - 2024/1/1

N2 - This paper presents a real-world liquid fuel distribution problem involving a heterogeneous fleet of multi-compartment vehicles servicing a set of orders of different fuels. Two new features are introduced that affect significantly the performance of the fuel distribution process in terms of safety and efficiency: (i) loading trucks so that the payload remains balanced throughout each phase of a delivery route, and (ii) sequencing the requests for loading trucks at the depot loading facilities. A Mixed Integer Programming formulation is presented and an Adaptive Large Neighbourhood Search algorithm with various novel features is developed and benchmarked. A new loading model is formed and solved for allocating the ordered items (fuel) to vehicle compartments, as part of constructing/repairing delivery routes. The computational performance of the proposed solution approach has been tested on a series of benchmark problems. Moreover, a series of experiments were performed in order to assess the effect of the balanced loading constraints on the traveled distance. The results indicate that the effect of this type of constraint on the total traveled distance is kept at a reasonable level, reaching a maximum increase of 4.37%. The computational tools presented in this work may accommodate the dispatchers’ work in producing efficient and safe delivery routes while managing efficiently any potential bottleneck in the truck loading facilities.

AB - This paper presents a real-world liquid fuel distribution problem involving a heterogeneous fleet of multi-compartment vehicles servicing a set of orders of different fuels. Two new features are introduced that affect significantly the performance of the fuel distribution process in terms of safety and efficiency: (i) loading trucks so that the payload remains balanced throughout each phase of a delivery route, and (ii) sequencing the requests for loading trucks at the depot loading facilities. A Mixed Integer Programming formulation is presented and an Adaptive Large Neighbourhood Search algorithm with various novel features is developed and benchmarked. A new loading model is formed and solved for allocating the ordered items (fuel) to vehicle compartments, as part of constructing/repairing delivery routes. The computational performance of the proposed solution approach has been tested on a series of benchmark problems. Moreover, a series of experiments were performed in order to assess the effect of the balanced loading constraints on the traveled distance. The results indicate that the effect of this type of constraint on the total traveled distance is kept at a reasonable level, reaching a maximum increase of 4.37%. The computational tools presented in this work may accommodate the dispatchers’ work in producing efficient and safe delivery routes while managing efficiently any potential bottleneck in the truck loading facilities.

KW - Adaptive Large Neighbourhood Search

KW - Hazardous materials

KW - Loading constraints

KW - Multiple compartments

KW - Sequencing

KW - Vehicle routing

U2 - 10.1007/s10479-023-05752-1

DO - 10.1007/s10479-023-05752-1

M3 - Journal article

VL - 332

SP - 909

EP - 947

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

M1 - 1

ER -