scispace - formally typeset
Search or ask a question

Showing papers by "Xiaolei Ma published in 2014"


Journal ArticleDOI
TL;DR: Results from a case study in Anshun, China reveal that the proposed approach outperforms the other three prevailing algorithms to resolve the customer clustering problem and demonstrates its capability of capturing the similarity and distinguishing the difference among customers.
Abstract: Customer clustering is an essential step to reduce the complexity of large-scale logistics network optimization. By properly grouping those customers with similar characteristics, logistics operators are able to reduce operational costs and improve customer satisfaction levels. However, due to the heterogeneity and high-dimension of customers' characteristics, the customer clustering problem has not been widely studied. This paper presents a fuzzy-based customer clustering algorithm with a hierarchical analysis structure to address this issue. Customers' characteristics are represented using linguistic variables under major and minor criteria, and then, fuzzy integration method is used to map the sub-criteria into the higher hierarchical criteria based on the trapezoidal fuzzy numbers. A fuzzy clustering algorithm based on Axiomatic Fuzzy Set is developed to group the customers into multiple clusters. The clustering validity index is designed to evaluate the effectiveness of the proposed algorithm and find the optimal clustering solution. Results from a case study in Anshun, China reveal that the proposed approach outperforms the other three prevailing algorithms to resolve the customer clustering problem. The proposed approach also demonstrates its capability of capturing the similarity and distinguishing the difference among customers. The tentative clustered regions, determined by five decision makers in Anshun City, are used to evaluate the effectiveness of the proposed approach. The validation results indicate that the clustered results from the proposed method match the actual clustered regions from the real world well. The proposed algorithm can be readily implemented in practice to help the logistics operators reduce operational costs and improve customer satisfaction levels. In addition, the proposed algorithm is potential to apply in other research domains.

104 citations


Journal ArticleDOI
TL;DR: This study attempts to develop a data-driven platform for online transit performance monitoring with primary data sources coming from the AFC and AVL systems in Beijing, where a passenger’s boarding stop and alighting stop on a flat-rate bus are not recorded.
Abstract: To improve customer satisfaction and reduce operation costs, transit authorities have been striving to monitor transit service quality and identify the key factors to enhance it. The recent advent of passive data collection technologies, e.g., automated fare collection (AFC) and automated vehicle location (AVL), has shifted a data-poor environment to a data-rich environment and offered opportunities for transit agencies to conduct comprehensive transit system performance measures. However, most AFC and AVL systems are not designed for transit performance measures, implying that additional data processing and visualization procedures are needed to improve both data usability and accessibility. This study attempts to develop a data-driven platform for online transit performance monitoring. The primary data sources come from the AFC and AVL systems in Beijing, where a passenger’s boarding stop (origin) and alighting stop (destination) on a flat-rate bus are not recorded. The individual transit rider’...

71 citations


Journal ArticleDOI
TL;DR: The experiment results demonstrate that the proposed tolling strategy performs reasonably well in improving the overall operations of HOT lane systems under various traffic conditions.
Abstract: In this paper, a self-adaptive tolling strategy (SATS) is developed for dynamically and systematically enhancing highoccupancy toll (HOT) lane system operations. This strategy enhances the overall system performance of both the HOT and general purpose (GP) lanes by better utilizing the HOT lane capacity while maintaining high speed and/or high travel-time reliability for HOT lane traffic when GP lanes are congested. To formulate SATS, the Lighthill-Whitham-Richards kinematic wave model is used to characterize HOT lane traffic flow evolution, and the unilateral Laplace transform is used to convert the system representation from the time domain to the frequency domain. Then, an adaptive tolling controller is designed with both the proportional and integral control components. Real-time traffic measurements, including lane occupancy, average speed, and flow rate, are utilized for toll rate calculations. Following a dual-phase control scheme, the appropriate flow rate for HOT lane utilization is computed, and the corresponding toll is estimated backward. To examine the effectiveness of the proposed tolling strategy, microscopic traffic simulation experiments are conducted using VISSIM. The experiment results demonstrate that the proposed tolling strategy performs reasonably well in improving the overall operations of HOT lane systems under various traffic conditions.

32 citations


Journal ArticleDOI
TL;DR: A two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithms to study the VRPSPDP problem is proposed and it is indicated that the proposed algorithm is superior to these three algorithms for VRPS PDP in terms of total travel cost and average loading rate.
Abstract: The vehicle routing problem (VRP) is a well-known combinatorial optimization issue in transportation and logistics network systems. There exist several limitations associated with the traditional VRP. Releasing the restricted conditions of traditional VRP has become a research focus in the past few decades. The vehicle routing problem with split deliveries and pickups (VRPSPDP) is particularly proposed to release the constraints on the visiting times per customer and vehicle capacity, that is, to allow the deliveries and pickups for each customer to be simultaneously split more than once. Few studies have focused on the VRPSPDP problem. In this paper we propose a two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithm to study the VRPSPDP problem. To validate the proposed algorithm, Solomon benchmark datasets and extended Solomon benchmark datasets were modified to compare with three other popular algorithms. A total of 18 datasets were used to evaluate the effectiveness of the proposed method. The computational results indicated that the proposed algorithm is superior to these three algorithms for VRPSPDP in terms of total travel cost and average loading rate.

19 citations


Journal ArticleDOI
TL;DR: This study proposes an approach to estimate the temporal IID, which separates IID from the total travel delay, estimates IID for each individual incident, and only takes volume as input for IID quantification, avoiding using speed data that are widely involved in previous algorithms yet are less available or prone to poor data quality.

17 citations