A metaheuristic for the pickup and delivery problem with time windows

By Haibing Li, Andrew Lim. Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001, 2001

455 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows (2009, methodology): “The Li and Lim instances are divided into two series. Those in the first series have a short planning horizon while those in the second have a longer horizon allowing many requests to be served in the same route. We only report computational results for the first series as only a small subset of the”
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, methodology): “This section describes how the LNS heuristic has been applied to the PDPTW. Compared to the LNS heuristic developed for the VRPTW and PDPTW by Shaw [21], [22] and Bent and Van Hentenryck [2], [4] the heuristic in this paper is different in several ways: 1.”
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (2003, methodology): “The SA neighborhood is based on a simple pair relocation operator, which is also used in [12,14,16].”
Horizontal cooperation among freight carriers: request allocation and profit sharing (2008, methodology): “Based on the existing PDPTW instances of Li and Lim (2001), we have generated three instances (T1, T2 and T3) for (cid:28)ve carriers.”
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (2013, unknown): “( Li and Lim, 2001), (Pankratz, 2005), (Ropke and Pisinger, 2006) and (S.”