EQUITY-ORIENTED TWO-ECHELON VEHICLE ROUTING PROBLEM: A THREE-PHASE HEURISTIC ALGORITHM.

International Journal of Industrial Engineering. 2025, Vol. 32 Issue 3, p564-579. 16p.

Fierce competition and the requirement for sustainable development compel catering services and urban logistics industries to balance cost-efficient transportation with improved service quality and customer equity. The two-echelon vehicle cooperation system, where a primary vehicle (truck) serves as a mobile base for a secondary vehicle (UAV), has gained attention for its potential to leverage the strengths of both vehicle types, enhancing operational efficiency and service delivery. This paper presents an equity-oriented two-echelon vehicle operation problem, where trucks and UAVs cooperate to provide equitable services. We model the problem as a mixed-integer linear program (MILP), incorporating equity considerations through a set of constraints. Specifically, we adopt the relative range scheme from the literature as an equity indicator, aiming to minimize the relative deviation between the maximum and minimum arrival times for unit demand across customers. To solve it, we propose a three-phase heuristic algorithm that dynamically adjusts equity constraints while minimizing transportation costs. Numerical experiments across various instance sizes show that the algorithm consistently produces high-quality solutions with optimality gaps of less than 10%. [ABSTRACT FROM AUTHOR]

*Mixed integer linear programming, *Vehicle routing problem, *Linear programming, *Heuristic algorithms, *Heuristic programming

Copyright of International Journal of Industrial Engineering is the property of International Journal of Industrial Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)