Mòdul d'assignació i routing d'un sistema de transport a la demanda

Es presenta una metaheurística basada en una Cerca Tabú per a resoldre el Pickup and Delivery Problem with Time Windows que s'utilitzarà en un sistema per a optimitzar les rutes d'un servei de taxis per a persones amb mobilitat reduïda del Servei Públic de transport especial de Barcelona.A metaheuristic based on a Tabu Search is presented to solve the Pickup and Delivery Problem with Time Windows This algorithm will be used in a system to optimize vehicle routes for a taxi service for persons with reduced mobility of the Public Service of Special Transport of Barcelona

Genetic Algorithm for Mulicriteria Optimization of a Multi-Pickup and Delivery Problem with Time Windows

International audienceIn This paper we present a genetic algorithm for mulicriteria optimization of a multipickup and delivery problem with time windows (m-PDPTW). The m-PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. This paper purposes a brief literature review of the PDPTW, present an approach based on genetic algorithms and Pareto dominance method to give a set of satisfying solutions to the m-PDPTW minimizing total travel cost, total tardiness time and the vehicles number