Promoting Two-sided Fairness in Dynamic Vehicle Routing Problem
<|reference_start|>Promoting Two-sided Fairness in Dynamic Vehicle Routing Problem: Dynamic Vehicle Routing Problem (DVRP), is an extension of the classic Vehicle Routing Problem (VRP), which is a fundamental problem in logistics and transportation. Typically, DVRPs involve two stakeholders: service providers that deliver services to customers and customers who raise requests from different locations. Many real-world applications can be formulated as DVRP such as ridesharing and non-compliance capture. Apart from original objectives like optimising total utility or efficiency, DVRP should also consider fairness for all parties. Unfairness can induce service providers and customers to give up on the systems, leading to negative financial and social impacts. However, most existing DVRP-related applications focus on improving fairness from a single side, and there have been few works considering two-sided fairness and utility optimisation concurrently. To this end, we propose a novel framework, a Two-sided Fairness-aware Genetic Algorithm (named 2FairGA), which expands the genetic algorithm from the original objective solely focusing on utility to multi-objectives that incorporate two-sided fairness. Subsequently, the impact of injecting two fairness definitions into the utility-focused model and the correlation between any pair of the three objectives are explored. Extensive experiments demonstrate the superiority of our proposed framework compared to the state-of-the-art.<|reference_end|>
@article{kang2024promoting,
    title={Promoting Two-sided Fairness in Dynamic Vehicle Routing Problem},
    author={Yufan Kang, Rongsheng Zhang, Wei Shao, Flora D. Salim, Jeffrey Chan},
    journal={arXiv preprint arXiv:2405.19184},
    year={2024},
    doi={10.1145/3638529.3654207},
    archivePrefix={arXiv},
    eprint={2405.19184},
    primaryClass={cs.AI}
}