Ramesh Ramasamy Pandi

Ramesh Ramasamy Pandi

Auto-generated profile, based on publicly available information

Ramesh Ramasamy Pandi

School of Electrical and Electronics Engineering, Nanyang Technological University, Singapore 639798

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
RPRamesh Ramasamy Pandi
Ramesh Ramasamy Pandi
SHSong Guang Ho
Song Guang Ho
Sarat Chandra NagavarapuSarat Chandra Nagavarapu
Sarat Chandra Nagavarapu
JDJustin Dauwels
Justin Dauwels
Accelerating the performance of optimization algorithms is crucial for many day-to-day applications. Mobility-on-demand is one such application that is transforming urban mobility by offering reliable and convenient on-demand door-to-door transportation at any time. Dial-a-ride problem (DARP) is an underlying optimization problem in the operational planning of mobility-on-demand systems. The primary objective of DARP is to design routes and schedules to serve passenger transportation requests with high-level user comfort. DARP often arises in dynamic real-world scenarios, where rapid route planning is essential. The traditional CPU-based algorithms are generally too slow to be useful in practice. Since customers expect quick response for their mobility requests, there has been a growing interest in fast solution methods. Therefore, in this paper, we introduce a GPU-based solution methodology for the dial-a-ride problem to produce good solutions in a short time. Specifically, we develop a GPU framework to accelerate time-critical neighborhood exploration of local search operations under the guidance of metaheuristics such as tabu search and variable neighborhood search. Besides, we propose device-oriented optimization strategies to enhance the utilization of a current-generation GPU architecture (Tesla P100). We report speedup achieved by our GPU approach when compared to its classical CPU counterpart, and the effect of each device optimization strategy on computational speedup. Results are based on standard test instances from the literature. Ultimately, the proposed GPU methodology generates better solutions in a short time when compared to the existing sequential approaches.

14 February 2018 in arXiv
Verified
Preprint
Open access
PDF file
SHSongguang Ho
Songguang Ho
Sarat Chandra NagavarapuSarat Chandra Nagavarapu
Sarat Chandra Nagavarapu
RPRamesh Ramasamy Pandi
Ramesh Ramasamy Pandi
JDJustin Dauwels
Justin Dauwels
Multi-vehicle routing has become increasingly important with the rapid development of autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In this paper, we propose an improved tabu search (ITS) heuristic for static dial-a-ride problem (DARP) with the objective of obtaining high-quality solutions in short time. Two new techniques, initialization heuristic, and time window adjustment are proposed to achieve faster convergence to the global optimum. Various numerical experiments are conducted for the proposed solution methodology using DARP test instances from the literature and the convergence speed up is validated.

1 January 2020 in IEEE Intelligent Transportation Systems Magazine
Verified
Journal Article
Closed access
RPRamesh Ramasamy Pandi
Ramesh Ramasamy Pandi
SHSong Guang Ho
Song Guang Ho
Sarat Chandra NagavarapuSarat Chandra Nagavarapu
Sarat Chandra Nagavarapu
TTTwinkle Tripathy
Twinkle Tripathy
JDJustin Dauwels
Justin Dauwels

29 June 2018 in arXiv
Verified
Preprint
Open access
PDF file
SHSong Guang Ho
Song Guang Ho
RPRamesh Ramasamy Pandi
Ramesh Ramasamy Pandi
Sarat Chandra NagavarapuSarat Chandra Nagavarapu
Sarat Chandra Nagavarapu
JDJustin Dauwels
Justin Dauwels
Dial-a-ride problem (DARP) deals with the transportation of users between pickup and drop-off locations associated with specified time windows. This paper proposes a novel algorithm called multi-atomic annealing (MATA) to solve static dial-a-ride problem. Two new local search operators (burn and reform), a new construction heuristic and two request sequencing mechanisms (Sorted List and Random List) are developed. Computational experiments conducted on various standard DARP test instances prove that MATA is an expeditious meta-heuristic in contrast to other existing methods. In all experiments, MATA demonstrates the capability to obtain high quality solutions, faster convergence, and quicker attainment of a first feasible solution. It is observed that MATA attains a first feasible solution 29.8 to 65.1% faster, and obtains a final solution that is 3.9 to 5.2% better, when compared to other algorithms within 60 sec.