摘要：This study discusses pickup and delivery problem with last-in-first-out, time duration, and limited vehicle number which is usually experienced by door to door courier service. In this problem, company’s vehicles will pick customer’s goods and deliver them from one location to another. Technically, LIFO policy is enforced when the assigned vehicles for transporting the goods have a single access point to loading-unloading process. This study develops integer linear programming formulation based on three index formulation. The model is solved by branch-and-bound algorithm. From experimental study, the result shows that optimal global solution, but takes long computation time. This computation time depends on the type of data used. From the 8 types of data with the same number of customers and vehicles, there is 1 data that can be solved within 1 second.
