A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows

@inproceedings{Bent2003ATH,
  title={A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows},
  author={R. Bent and Pascal Van Hentenryck},
  booktitle={CP},
  year={2003}
}
  • R. Bent, Pascal Van Hentenryck
  • Published in CP 2003
  • Computer Science
  • This paper presents a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW). The first stage uses a simple simulated annealing algorithm to decrease the number of routes, while the second stage uses LNS to decrease total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best solutions on problems with 100, 200, and 600 customers. In particular, it has improved 47% and 76% of… CONTINUE READING
    151 Citations

    Figures, Tables, and Topics from this paper.

    A heuristic for the vehicle routing problem with due times
    • 15
    Ant Colony Optimization for the Single Vehicle Pickup and Delivery Problem with Time Window
    • Yu-Hsuan Huang, C. Ting
    • Computer Science
    • 2010 International Conference on Technologies and Applications of Artificial Intelligence
    • 2010
    • 6
    A heuristic method for the vehicle routing problem with backhauls and inventory
    • 30
    • PDF
    Solving Vehicle Routing Problem with Time Window Constraints

    References

    SHOWING 1-10 OF 28 REFERENCES
    A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
    • 355
    • PDF
    The Pickup and Delivery Problem with Time Windows
    • 433
    Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
    • M. Solomon
    • Mathematics, Computer Science
    • Oper. Res.
    • 1987
    • 3,130
    • PDF
    Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation
    • 377
    • Highly Influential
    Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
    • 1,178
    • Highly Influential
    • PDF
    Pickup and delivery with time windows: algorithms and test case generation
    • H. C. Lau, Zhe Liang
    • Computer Science
    • Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001
    • 2001
    • 52
    • PDF
    Pickup and Delivery with Time Windows: Algorithms and Test Case Generation
    • 57
    A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem
    • 520
    • PDF
    A Metaheuristic for the Pickup and Delivery Problem with Time Windows
    • H. Li, A. Lim
    • Computer Science
    • Int. J. Artif. Intell. Tools
    • 2003
    • 190
    • Highly Influential