Abstract
The periodic vehicle routing problem (PVRP) can be applied to extend deliveries to a known number of customers in one day to several days (a period). Vehicle routing has to be planned in accordance with different customer clusters with service demand on each day of the period. Therefore, a two-dimensional discrete PSO (TDPSO) is designed in this study to find solutions to the two sub-problems when dealing with a vehicle routing problem (VRP): (1) which vehicle should provide service to which customers, the customer-vehicle correspondence, and (2) the order of visits to the customers, the optimal vehicle routing. Meanwhile, an advanced savings method is designed in this study and employed in combination with local search to improve algorithm performance. Data from the PVRP benchmark of OR-Library are adopted to conduct TDPSO performance tests. The outcomes prove that method proposed in this study can effectively find solutions to PVRP problems and establish the optimal vehicle routing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
