PDPTW based taxi dispatch modeling for booking service

Authors:
Hao Wang;Der-Horng Lee;Ruey Cheu
Affiliations:
Ningbo Institute of Technology, Zhejiang University, P.R. China;Dept. of Civil Engineering, National University of Singapore, Singapore;Dept. of Civil Engineering, University of Texas at El Paso, United States
Venue:
ICNC'09 Proceedings of the 5th international conference on Natural computation
Year:
2009

Citing 4
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A tabu search heuristic for the vehicle routing problem

Management Science
Tabu Search

Tabu Search
A Metaheuristic for the Pickup and Delivery Problem with Time Windows

ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This research involves a study of the existing taxi dispatch system employed by taxi operators in Singapore. Based on the booking surcharges, there are generally two categories of taxi bookings, current and advance. Current bookings are requests that taxi should reach the customer immediately or within half an hour, and advance bookings are requests made at least half an hour in advance. In this paper, a novel trip-chaining strategy for taxi advance booking based on a customized algorithm of Pickup and Delivery Problem with Time Window (PDPTW) was proposed. The idea is to chain several bookings with demand time points which are spread out within a reasonable period of time, and with each pick-up point coinciding with or being within close proximity to the previous drop-off location. Based on the experimental results, the proposed system has the potential to improve the taxi booking service currently operating in Singapore.