Abstract
This paper defines a multiobjective variant of the Pickup and Delivery Problem (PDP), called PDP with Time Windows and Demands (PDP-TW-D), and approaches the problem with a novel memetic optimization algorithm. With respect to multiple optimization objectives, the goal of PDP-TW-D is to find a set of Pareto-optimal routes for a fleet of vehicles in order to serve given transportation requests. This paper considers five optimization objectives for PDP-TW including the number of vehicles, the total travel distance and the total waiting time. The proposed algorithm is designed as an evolutionary multiobjective optimization algorithm that is augmented by a local search algorithm. It uses the population of individuals, each of which represents a solution candidate, and evolves them via genetic operators (e.g., crossover and mutation operators) through generations. In addition to this global search process, it allows individuals to improve themselves in each generation through local search. Experimental results show that the global and local search processes complement to improve convergence speed and can effectively obtain quality trade-off solutions with respect to conflicting objectives.
Sign-in/Register to access full text options 
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.
