Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows

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 pr...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2011-01
Main Authors: Dridi, Imen Harbaoui, Ryan Kammarti, Borne, Pierre, Mekki Ksouri
Format: Article
Language:English
Subjects:
Genetic algorithms
Literature reviews
Lower bounds
Multiple objective analysis
Optimization
Route planning
Routing
Windows (intervals)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422