@MASTERSTHESIS\{IMM2005-04003,
    author       = "L. Li",
    title        = "Pickup and Delivery Problem with Hub Reloading",
    year         = "2005",
    keywords     = "vehicle routing problem, pickup and delivery problem, mathematical model, heuristics, Insert\_By\_Distance, Sweep\_By\_Angle",
    school       = "Informatics and Mathematical Modelling, Technical University of Denmark, {DTU}",
    address      = "Richard Petersens Plads, Building 321, {DK-}2800 Kgs. Lyngby",
    type         = "",
    note         = "Supervised by Assoc. Prof. Jesper Larsen",
    url          = "http://www2.compute.dtu.dk/pubdb/pubs/4003-full.html",
    abstract     = "Along with the development of the society and the progress of the science, people around the world are devoting themselves to explore the better and better approaches to deal with all kinds of problems we are facing in the real life or our generations may confront to in future.

Nowadays, scientists are no more focusing on solving problems temporarily. They pay more close attention to adopt right and better ways and do their best to overcome problems permanently. This sort of the aspiration does not only belong to the developed countries. Since the explored and good methods have stimulated large batch of developed and developing countries, even the whole world attempt to apply the scientific means to solve problems effectively. Thus, the life of human being cannot go ahead well without science. Meanwhile, when we use the scientific way to help us settle problems, we also need to investigate right resolved approaches audaciously and continuously.

In the main content of this thesis, we will meet a new kind of transportation problem, which is a pickup and delivery problem with hub reloading at the central depot. In this pickup and delivery problem, every pickup source has a corresponding delivery terminations. We set each request includes the relative pickup and delivery actions and those two actions cannot be handled by the same vehicle. In other words, the pickup part and delivery part are separated in this project. My idea of resolving this problem can be described briefly as the way that: firstly, consider the pickup and delivery parts as two vehicle routing problems. Secondly, connect the relative pickup and delivery actions in each request under the time constraint. Along with the steps, I have displayed the relevant mathematical model. The goal is to find short routes and make every request to be finished in a limited time period are my work."
}