The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.
@article{arxiv.1101.3396,
title = {Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows},
author = {Imen Harbaoui Dridi and Ryan Kammarti and Pierre Borne and Mekki Ksouri},
journal= {arXiv preprint arXiv:1101.3396},
year = {2013}
}
Comments
arXiv admin note: text overlap with arXiv:1101.3396