In English

A Complete Customer-to-Customer Shipment Scheduling Module Solving the CVRPTW and MSTPP problems

Marcus Hedenström ; Mattias Sjöblom
Göteborg : Chalmers tekniska högskola, 2012. 34 s.
[Examensarbete på avancerad nivå]

We implement a module for scheduling orders within a transportation network, considering both a pickup route between customers and a terminal,and the transportation between terminals. Our goal is to schedule the full set of orders, minimizing the total cost by having orders share transportation vehicles when possible, even in the non-trivial case when some orders need to be diverted from their own shortest path to do so. We evaluate the effectiveness of a genetic algorithm on the vehicle routing problem, and implement a serialization protocol.

Nyckelord: MSTPP, steepest descent/greedy algorithm, k shortest paths, vehicle routing, CVRPTW, Genetic algorithms



Publikationen registrerades 2012-05-08. Den ändrades senast 2013-04-04

CPL ID: 157435

Detta är en tjänst från Chalmers bibliotek