Set divisions and customer point collaborations-based heuristic vehicle routing with appointment time window

摘要

This paper studies the collaboration-based vehicle routing problem with appointment time window aiming at the pickup and delivery service to airport. After defining the satisfaction degree under appointment time window, a heuristic approach is proposed to find the globally optimal vehicle routing scheme. By modeling the pickup and delivery service to airport with and without collaborations, the corresponding multi-constraint models are built. Set divisions and vehicle collaborations at customer points are considered to find the optimal basic and collaborative routes. Thus the optimal vehicle routing scheme with appointment time window can be created. Simulation results show that the proposed approach is feasible.