Abstract

In this paper, we present a multi-objective shortest path evolutionary algorithm for comprehensive solutions to real-world manifestations of the classical vehicle routing problem. The shift from being a purely academic pursuit is highlighted by the introduction of a generic optimization framework which accommodates a variety of attributes that commonly occur in industrial applications. Specifically, the paper's main contribution are as follows: (1) consideration for the following real-world constraints: (a) time windows at customer locations, (b) simultaneous pickup and delivery demands, (c) a heterogeneous fleet of vehicles, and (d) the heterogeneity of traffic congestion levels in urban transportation networks; (2) assimilation of all the above attributes into a multi-objective program which aims to minimize environmental impact, while simultaneously addressing the overall operational costs of the routing solution and service quality concerns; a feat that has not been fully realized by known intelligent systems according to the authors’ best knowledge. In order to showcase the efficacy of the proposed algorithm, it is first tested on existing benchmark instances and then applied on a pair of real-world industrial examples from Singapore. These industrial examples serve as a source of new benchmarks which facilitate the study of different routing constraints and their effects on the economic and environmental viability of urban logistics systems.

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 call

Disclaimer: 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.