Browsing by Author "Han, Anthony F."

Now showing 1 - 4 of 4

A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system
(2014-12-01)
Han, Anthony F.
;
Li, Elvis C.
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
This paper addresses the crew scheduling problem for a mass rapid transit (MRT) system. The problem is to find a minimum number of duties to cover all tasks while satisfying all the hard and soft scheduling rules. Such rules are complicated in real-world operations and difficult to follow through optimization methods alone. In this paper, we propose a constraint programming (CP)-based approach to solve the problem. The approach involves a CP model for duty generation, a set covering problem model for duty optimization, and alternative ways to identify the final solution in different situations. We applied the proposed CP-based approach to solve a case problem for the Taipei MRT. Case application results using real-world data showed that our approach is capable of reducing the number of daily duties from 58 to 55 and achieving a 5.2 % savings in labor costs. We also incorporated the soft rule considerations into the CP model in order to generate alternative optimum solutions that would improve the workload balance. The coefficient of variation of the work time distribution improves significantly, falling from 21 % to approximately 5 %. Given the CP model\'s comprehensive coverage of various scheduling rules, our proposed approach and models would also be applicable to other MRT systems.
NEIGHBORHOOD SEARCH METHODS DESIGNED FOR SPLIT DELIVERY VEHICLE ROUTING PROBLEMS
(2011-01-01)
Han, Anthony F.
;
Cho, Yuh-Jen
;
Chu, Herman Y.
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Split delivery vehicle routing problem (SDVRP), which allows the demand of a customer to be split and delivered by multiple vehicles, is a variant of conventional vehicle routing problem (VRP). The potential savings due to the split delivery has proved to be as much as 50%. However, until recently, most studies in solving SDVRP did not involve neighborhood search methods tailor-made for split deliveries. In this article, we present two new neighborhood search methods, i.e. 2-opt** and Ejection-chain*, and an innovative construction algorithm designed for SDVRP. We have tested the new methods on two sets of benchmark problems with a variable neighborhood descent approach. It is found that our proposed approach has obtained 3 new best solutions for the 57 benchmark instances tested. Such results indicate a great potential of further applications of our proposed local search methods for SDVRP.
Residents' perceptions on the traffic impact of a special event: a case of the Macau Grand Prix
(2018-01-01)
Han, Anthony F.
;
Wong, K. I.
;
Ho, S. N.
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Special events may cause significant disruptions to the community and affect the daily lives of the local residents. This study examines how local residents perceive the traffic impact of a major tourism event, the Macau Grand Prix, which is an annual event that takes place on a circuit around the streets of the city, Macao. An exploratory factor analysis reveals five factors regarding the traffic impacts of the event, and the residents of different transportation modes have distinct views on the traffic measures. Bus transit and pedestrian traffic management is found to be the most effective. The result provides the event organizer implications and assessment for the traffic planning and management measures in gaining support from the community.
WAITING STRATEGIES FOR THE DYNAMIC DIAL-A-RIDE PROBLEM
(2007)
Yuen, C. W.
;
Wong, K. I.
;
Han, Anthony F.
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management