Intelligent Taxi Dispatch System for Advance Reservations

Size: px
Start display at page:

Download "Intelligent Taxi Dispatch System for Advance Reservations"

Transcription

1 Intelligent Taxi Dispatch System for Advance Reservations Hao Wang, Ningbo Institute of Technology, Zhejiang University Ruey Long Cheu, The University of Texas at El Paso Der-Horng Lee, The National University of Singapore Abstract This research proposes and tests a new taxi dispatch policy to improve the existing systems used by taxi companies in Singapore. The proposed method chains trips made by reservations at least 30 minutes before the customer pick-up times. In this paper, the taxi dispatching system, Singapore Taxi Advance Reservation (STAR), is defined. A novel trip-chaining strategy based on a customized algorithm of Pickup and Delivery Problem with Time Window (PDPTW) is proposed. The idea is to chain several taxi trips with demand time points that are spread out within a reasonable period of time and with each pick-up point in close proximity to the previous drop-off location. The strategy proposed has the potential to lower the taxi reservation fee in Singapore to encourage advance reservations that facilitate trip chaining, which translates to lower taxi fares for customers, higher revenue for taxi drivers, and lower fleet ownership cost for taxi companies. Introduction Taxis are a popular transportation mode in the compact city state of Singapore. With the high cost of private vehicle ownership, taxis play an important role in offering an alternative transportation service. Fast and efficient fleet dispatching is essential to the provision of quality customer service in a competitive taxi industry. Satellite-based taxi dispatching systems, which track taxis using Global Positioning System (GPS) technology, are currently deployed by taxi companies in Singapore. Taxis on the road network are tracked, located, and dispatched to customers in real-time. Table 1 shows the related data of major taxi companies in Singapore. Based on the reservation fees (known locally as booking surcharges ), there are generally two categories of taxi reservations in Singapore: current and advance. Current reservations are those in which customers request vacant taxis (i.e., taxis without passengers) to reach them in less than 30 minutes. Advance reservations (known locally as advance bookings ) are requests made at least 30 minutes in advance. The focus of this paper is on advance reservations. Journal of Public Transportation, Vol. 17, No. 3,

2 TABLE 1. Major Taxi Companies in Singapore and Their Fare Structures Taxi Company Fleet Size (veh) Current Reservation Fee Advance Reservation Fee Fare for 1st km Prime Taxis 731 SGD $3.50 SGD $5.00 SGD $3.00 Premier Taxis 2,436 SGD $3.50 SGD $8.00 SGD $3.00 Yellow-Top 1,090 SGD $3.50 SGD $8.00 SGD $3.00 CityCab 5,592 SGD $3.50 SGD $8.00 SGD $3.00 Smart Taxis 2,441 SGD $5.00 SGD $10.00 SGD $3.00 Comfort Taxis 15,200 SGD $3.50 SGD $8.00 SGD $3.00 Trans-Cab 4,230 SGD $3.30 SGD $6.50 SGD $3.00 SMRT Taxis 3,150 SGD $3.30 SGD $8.00 SGD $3.00 Meter Fare by Distance SGD $0.20/385m between 1 km and 10 km; SGD $0.20/330m after 10 km SGD $0.22/400m between 1 km and 10 km; SGD $0.22/350m after 10 km Note: SGD $1.00 = US$0.81 in May 2013; other fees such as peak hour surcharge, midnight surcharge, and airport surcharge, etc., are not included in this table. The paper is organized as follows. Following this introduction, a description of the existing taxi dispatch systems in Singapore and their deficiencies are presented. The proposed taxi dispatch system to handle advance reservations is presented in the next section. This is followed by several sections that illustrate the computational methodologies of the new system, which includes the paired Pickup and Delivery problem with Time Window (PDPTW) models; a review of closely-related literature; the Singapore Taxi Advance Reservation (STAR) system with its special requirements; a customized two-phase trip-chaining solution algorithm; and the study network and Application Program Interface (API) programming for traffic simulations. The results of simulation experiments are subsequently presented, followed by a discussion on the performance of the proposed system. Finally, the benefits of the proposed system for customers, drivers, and taxi companies are highlighted in the conclusion. Existing Taxi Dispatch System and Its Deficiencies In Singapore s taxi industry, taxi companies own the vehicles. Drivers rent taxis from companies by paying fixed daily fees. All the taxis subscribe to, and are part of, the company s dispatch system. When a customer requests a taxi in advance, either by phone or by Internet, the company s dispatch center broadcasts the trip information immediately to all taxis (with and without passengers) in its fleet. Since advance reservation is a service that should be fulfilled at least 30 minutes later, it is up to the taxi drivers to decide if they want to bid to serve this customer. Drivers do not have to pay for the bid; the dispatch system assigns the job to the first driver who bids for it. Under this dispatch policy, trip demands and taxi assignments are distributed without any consideration of fleet or revenue optimization. For instance, up to 100 different taxis might be assigned to fulfill an equal number of reservations. Hence, the taxi supply may not be significantly used. A commitment to a reserved trip usually affects a taxi s street pick-up service. Taxi drivers often face a dilemma when the time is approaching for a customer who has made an Journal of Public Transportation, Vol. 17, No. 3,

3 advance reservation to be picked up. If a driver picks up a roadside passenger, he/she may not be able to subsequently pick up the customer who has made an advance reservation. Conversely, if the driver gives up the street pick-up business, this becomes opportunity cost for him/her to serve the customer with an advance reservation. This situation has been used by taxi companies in Singapore to justify why the advance reservation fee is more than two times than that of current reservations, in all except one company (see Table 1). Taxi customers in Singapore have to bear an unreasonable price structure when making reservations. To some extent, customers are encouraged to shop for taxi services at the last minute, either through street hailing or through current reservations, to avoid paying higher fees. This cost-saving behavior causes the customer to take the risk of not being able to find a vacant taxi. These problems are essentially due to the inability of the existing taxi dispatch systems to make full use of customer advance reservation information. Hence, a new and more intelligent taxi dispatch system that encourages advance reservations and makes better use of this information for fleet optimization is an urgent priority. Concept of Trip Chaining To take full advantage of advance reservation information, several trips may be chained to form a route and offered to a taxi driver as a package. This means that several reserved trips with spatial and temporal distributions of customer requests may be linked, provided that (1) each pick-up point is within close proximity to the previous drop-off location and (2) the pick-up time for the next customer must be later than the estimated drop-off time of the previous customer, but not too late. This will help the driver to minimize his/her vacant time (cruising around in search of roadside customers), as most of his/ her time will be spent carrying passengers on board and generating revenue. Computation Methodologies In this research, the heuristics for the PDPTW were adapted to chain taxi trips in the proposed taxi dispatch system. Paired PDPTW Models Paired PDPTW models the situation in which a fleet of vehicles must serve a collection of transportation requests. Each request specifies a pair of pick-up and delivery locations. Vehicles must be routed to serve all the requests, satisfying time windows and vehicle capacity constraints while optimizing a certain objective, such as minimizing the total number of vehicles used or the total distance traveled. PDPTW is a generalization of the well-known Vehicle Routing Problem with Time Window (VRPTW). Therefore, PDPTW is also an NP-hard problem, since VRPTW is a well-known NP-hard problem (Savelsbergh 1995). Related Works in Literature PDPTW can be used to model and solve many problems in the field of logistics and public transit. As a special case of pick-up and delivery, dial-a-ride emphasizes human convenience (Cordeau and Laporte 2002) for example, door-to-door transportation Journal of Public Transportation, Vol. 17, No. 3,

4 services for older adults, or people who are sick or have disabilities (Borndorfer et al. 1997; Madsen et al. 1995; Toth and Vigo 1997) and shuttle bus services connecting airports and customer homes. Parragh et al. (2008a, 2008b) conducted a comprehensive survey on the topic of pick-up and delivery. In practice, transportation requests using dial-a-ride are usually booked at least one day in advance. Therefore, much research focuses on the static and deterministic version of this problem. William and Barnes (2000) proposed a reactive Tabu search approach to minimize travel cost by using a penalty objective function in terms of travel time, a penalty for violation of overload, and time window constraints. The approach was tested on instances with 25, 50, and 100 customers. These test cases were constructed from Solomon s C1 VRPTW benchmark instances (Solomon 1987), which were solved optimally. Researchers such as Lau and Liang (2002) and Li and Lim (2001) generated many test cases for PDPTW from Solomon s benchmark instances that were initially designed for VRPTW and proposed different versions of Tabu search embedded meta-heuristics to solve PDPTW. Recently, Parragh et al. (2009) used a variable neighborhood search heuristics coupled with path relinking to jointly minimize transportation cost and average ride time for a dial-a-ride system with multiple service criteria. In addition, many authors, such as Beaudry et al. (2010) and Jorgensen et al. (2007), incorporated quality-of-service considerations into the solution of the dial-a-ride problem. However, few papers modeled after realworld applications with large-scale sample size have been found in published literature. The STAR Problem and its Special Requirements This section analyzes the problem as defined by the authors as the STAR problem. Based on the characteristics of the taxi dispatch service for advance reservations, the differences between STAR and the normal PDPTW are as follows: 1. Multiple vehicles are available throughout the street network instead of starting from a central depot. 2. Pick-up and delivery jobs are paired and directly connected without any interruption from other pick-up or delivery jobs. 3. There is a hard time window customers will complain if the taxi is late by more than three minutes. Therefore, the pick-up time window becomes [-, pick-up time as specified by the customer]. 4. Vehicle capacity constraints are automatically respected by customers in real life, customers will consider this constraint when specifying the number of taxis to be booked. 5. There is a short confirmation response time after submitting an advance reservation request, customers usually expect to receive a confirmation (by phone call, text message, or ) with a taxi s license plate number, pick-up time, and location in less than five minutes; therefore, real-time route planning is highly desirable. Journal of Public Transportation, Vol. 17, No. 3,

5 During route planning (chaining of trips), the following information is available: 1. Requests for taxi service are identified in advance at each planning horizon. 2. For each customer, pick-up location (origin), delivery location (destination), and desired pick-up time are known. 3. Driving distances between these locations are well understood, and driving time between each origin-destination (O-D) pair is known. 4. Average service time, i.e., time consumed after customers get on board, pays, and alights from the vehicle, is based on historical statistics. There is a wide variety of objective functions for PDPTW. In the STAR problem, the following objectives are considered: 1. Minimizing the number of vehicles, the highest cost component for a taxi company. 2. Minimizing the travel time or distance, which usually translates into minimizing fuel consumption, the highest component of operating cost for drivers. To model these objectives, the following function has been considered: Minimize C m + ƒ(r) (1) where, m is the total number of taxis used, R is a pick-up and delivery route plan, ƒ(r) is the total travel cost (converted from driving time or distance), and C is a coefficient set to penalize the high cost of vehicle. The first term in the above objective function may be considered as the fixed cost and the second term the variable cost. The Two-Phase Solution Heuristics for the STAR Problem It has been shown that a successful approach for solving PDPTW is to construct an initial set of feasible routes that serve all the customers (known as the construction phase) and subsequently improve the existing solution (known as the improvement phase) (Gendreau et al. 1994; Glover and Laguna 1997). However, the characteristics and requirements of the STAR problem preclude straightforward implementation of most algorithms that have been developed for the normal VRPTW or PDPTW. In this section, a two-phase approach for solving the STAR problem is proposed. Construction Phase The nearest-neighbor heuristic adds on the closest customer for extending a route. A new vehicle is introduced when no more customers can be accommodated by the current vehicle in use (Toth and Vigo 2000). 1. Let all the vehicles have empty routes (with no customer assignment). 2. Let L be the list of unassigned requests. 3. Take a trip v from L in which the requested pick-up location is the nearest from the previous drop-off location of a route. 4. Insert v to extend the abovementioned route (if v satisfies all the constraints). Journal of Public Transportation, Vol. 17, No. 3,

6 5. Remove v from L. 6. If L is not empty, go to step 3; otherwise stop. The earliest time insert heuristic always inserts the trip with the earliest pick-up time instead of the nearest pickup location. The sweep heuristic builds routes by using a sweep technique around a certain location. The sweep heuristic for VRP is shown below: 1. Let O be a site (usually the depot) which serves as a central point, and let A be another location, which serves as a reference. 2. Sort the jobs by increasing angle AOJ, where J is the pickup location. Place the result in a list L. 3. The jobs in L will be allocated to taxis in the above order as long as constraints are respected. The initial feasible solution is then improved in the improvement phase. Improvement Phase In the improvement phase, two types of move operations exchange and relocate are combined with Tabu search to improve the solution. A move in this approach corresponds to one of the traditional vehicle-routing move operations. In this study, the steepest descent search was applied. An exchange operation swaps trips in two different existing routes, whereas in a relocation operation, a customer is removed from an original route, inserted into another route, or reinserted into the same route but at a different position. A move is considered feasible if the corresponding operation does not violate any requirement (for instance, time constraints). Hence, the neighborhood of the current solution is defined as all the feasible moves. In each iteration of the steepest decent approach, the feasible move that gives the best improvement (or least deterioration) of the cost is selected. To avoid the search from revisiting the same solution in the near future, the Tabu search mechanism was introduced. A Tabu list records the previous moves performed. A potential move is considered Tabu if it is in the Tabu list. Moreover, a move is aspired if the resultant cost is lower than the cost of the best solution encountered. If the best move selected by the steepest decent approach is Tabu and not aspired, then the next best move in the neighborhood of the current solution would be considered; otherwise, the selected move is made. The improvement process in this phase continues until a preset maximum number of iterations (maxiter) or a pre-set maximum computation time (maxtime) has been reached. The key steps of the improvement phase are as follows: 1. Let the current solution X be the feasible solution generated in the construction phase, and set the solution of best so far z * =. 2. Choose the best move bestmove from the neighborhood of the current solution. 3. If bestmove is Tabu and not aspired, repeat from Step 2; otherwise, accept bestmove and update the solution x and cost z(x). Journal of Public Transportation, Vol. 17, No. 3,

7 4. If z(x) < z *, then x * = x and z * = z(x). 5. Repeat steps 2 4 until the number of iterations equals maxiter or until maxtime computation time has been performed. 6. Output x * and z *. Simulation Experiment This section describes the experiment conducted to test the proposed two-phase solution approach for the STAR problem. A customized microscopic simulation model, PARAMICS (Quadstone 2009), was adopted to generate time-dependent link travel times for the experiment. A portion of the Central Business District (CBD) area in Singapore, which is bounded by the Electronic Road Pricing (ERP) gantries and covers an area of approximately 3.0 km by 2.5 km, was used for the simulation. For network coding, the details of the geometry and physical layout of the roads were collected via field surveys. The coded network features included the number of lanes (mid-block and at intersections), turn restrictions, posted speed limit, etc. Signal timing plans, O-D matrices of background traffic, and boundaries of traffic analysis zones in the CBD area were collected from the Land Transport Authority of Singapore. The coded CBD network in PARAMICS consisted of a total of 894 nodes and 2,558 links. The 100 traffic analysis zones in this network were defined according to the traffic demands of each zone, which were allocated according to the acquired hourly O-D data. Figure 1 is a screen shot of the CBD network coded in PARAMICS. FIGURE 1. Simulated CBD network of Singapore Journal of Public Transportation, Vol. 17, No. 3,

8 A customized program developed through PARAMICS Application Programming Interface (API) was developed to collect the time-dependent travel time of each link in the CBD network as the simulation progressed. These travel times were used to construct the link-to-link travel time between each pickup and drop off locations. As there are ERP gantries to separate the CBD area from other parts of Singapore, a fleet of taxis may always do their business within the CBD to avoid the ERP toll. Based on the data provided by taxi companies in Singapore, approximately 3,000 advance bookings are made during the day time (from 8:00 AM to 6:00 PM) across the whole island of Singapore. We assume that one-third of the above demands (pick-up and drop-off locations) are within the CBD area. In this study, 1,000 pairs of taxi pick-up and drop-off locations were randomly generated from among 100 major trip generators (e.g., major office buildings, shopping malls, hospitals, hotels, and convention centers) to form a demand set. The pick-up times were from 8:00 AM to 6:00 PM (see Table 2). For each demand set, the average pickup time deviation is defined as, where T i is the desired pickup time and T is the average pickup time for all the n=1000 requests within a demand set. Ten sets of taxi demands were generated. The average deviation of pick-up times for each set varied from half an hour to more than two hours (see Table 3). To study the performance of the proposed heuristics, the pick-up time deviation could not be too small during the experiment. This is because an extremely small deviation means that all the pick-ups will happen at almost the same time and, thus, there is very limited opportunity to chain these trips. Experimental Results All the computation works were carried out in a personal computer with an Intel Core i3 CPU and 4 GB of RAM. To solve the STAR problem, numerical comparisons between the proposed insertion earliest time window insertion and other construction heuristics. The results are listed in Table 4. The computation times of these construction heuristics always took less than 30 seconds to arrive at the initial solution with a problem size of 1,000 trips in this study. Then, each of these initial solutions was improved by using the move operations and Tabu search procedure. The Tabu search had a pre-set maximum computation time of 30 seconds. The results at the end of the improvement phase are shown in Table 5. In the objective function, ƒ(r) was set to the total travel time of all the routes. Intuitively, C could be set to 6 hrs 60 minutes/hr = 360 minutes so that the term C m is equivalent to the total taxi-hours available to serve customers during the 6-hour planning horizon. This will also convert C m to the unit of travel time in minutes used in ƒ(r). However, in our experiment, C was set to a very high value so that the objective function forced the solution to converge to the minimum number of taxi used. This was done deliberately so that the different heuristics could be evaluated by comparing the number of routes or taxis. Journal of Public Transportation, Vol. 17, No. 3,

9 TABLE 2. Example of Randomly- Generated Demand Set with 1,000 Trips Reservation Request Pick-up Location Destination Location Pick-up Time 1 The Paragon Tower Parco Bugis Junction 9:30 AM 2 Cairnhill Place Bank of China 9:55 AM 3 Sunshine Plaza People s Park Complex 11:40 AM 4 Sin Tai Hin Building Centennial Tower 8:35 AM 5 Parco Bugis Junction Maxwell Road Food Center 8:25 AM 6 Bugis Village UIC Building 1:25 PM 7 Golden Mile Complex Air View Building 4:35 PM 8 Keypoint Building People s Park Complex 10:30 AM 9 Ngee Ann City OUB Center 8:25 AM 10 Singapore Power Building Centennial Tower 5:10 PM 11 Suntec City Tower Sunshine Plaza 8:50 AM 12 Centennial Tower Air View Building 4:45 PM 13 People s Park Complex Ngee Ann City 8:05 AM 14 Ministry of Manpower Golden Mile Complex 10:00 AM 15 OUB Center The Paragon Tower 9:45 AM 16 Bank of China Golden Mile Complex 8:10 PM 17 Maxwell Road Food Center CPF Building 8:05 PM 18 Air View Building Sin Tai Hin Building 3:30 PM 19 CPF Building Ngee Ann City 2:10 PM 20 UIC Building Bugis Village 4:50 PM The Paragon Tower Centennial Tower 11:15 AM 1000 Suntec City Tower Golden Mile Complex 3:45 PM Average deviation of pick-up time: 62.7 minutes TABLE 3. Average Pick-up Time Deviation within Each Demand Set Demand Set Average deviation of pick-up time (min) Journal of Public Transportation, Vol. 17, No. 3,

10 TABLE 4. Initial Solutions after Construction Phase (a) Initial solutions by nearest neighbor insertion heuristic Demand Set Average Taxis used Total travel time (min) (b) Initial solutions by sweep insertion heuristic Demand Set Average Taxis used Total travel time (min) (c) Initial solutions by earliest time window insertion heuristic Demand Set Average Taxi used Total travel time (min) From Table 4, it can be observed that the initial solution from the proposed earliest time window insertion heuristic was significantly better than the other two heuristics (nearest neighbor insertion and sweep insertion) in terms of the number of taxis required. However, a smaller number of routes (or taxis) could increase the total travel time (for example, see the total travel times for demand set 1 in Tables 4(a), 4(b) and 4(c)). This is because the calculation of travel time of each route involved in this study began with the origin of the first booking demand and ended with the destination of the last trip and included all the travel times between these connected trips (between drop-offs and pick-ups). Therefore, using fewer routes may force taxis to travel a longer distance or time between last drop-offs and next pick-ups, i.e., vacant or empty cruising between jobs. In the improvement phase, the Tabu search has proven to be so efficient that even fairly poor initial solutions (in Table 4[a],4[b]) can be improved into solutions (in Table 5[a],5[b]) which are comparable to those of good initial solutions. Journal of Public Transportation, Vol. 17, No. 3,

11 TABLE 5. Solutions after Improvement Phase (a) Improved solutions by nearest neighbor insertion heuristic Demand Set Average Taxis used Total travel time (min) (b) Improved solutions by sweep insertion heuristic Demand Set Average Taxis used Total travel time (min) (c) Improved solutions by earliest time window insertion heuristic Demand Set Average Taxis used Total travel time (min) Overall, the larger the booking time deviation, the fewer the taxis required. However, the deviation defined as indicates only the average deviation from the average pick-up time. A large value of deviation does not necessarily mean that the pick-up times are evenly distributed that could lead to a solution in which fewer taxis are necessary. Through the customized two-phase approach, a practical routing plan for a batch of 1,000 advance reservations could be generated quickly to provide real-time dispatch decisions. Under the existing taxi dispatch system, these 1,000 advanced reservations may be taken up by up to 1,000 different taxis. However, through our proposed trip-chaining strategy, these 1,000 trips may be grouped into fewer than 80 routes and assigned to a fleet with fewer than 80 taxis (see Table 5). The reduction of fleet size involved in reservation service is significant. The authors caution that the above reduction in fleet size is computed for taxis that respond to advance reservations. This is because, although only a small fleet of taxis is necessary to cater to the advance reservations, the other taxis are free to pick up customers who make current reservations or are on the streets at any time. Having two different groups of taxis, each specializing in different types of customers or trips, will most likely lead to better utilization of taxis and increased revenue for the drivers. However, this scenario is much more complex to analyze and will be the direction of future research. Journal of Public Transportation, Vol. 17, No. 3,

12 Conclusion This research has identified the STAR taxi dispatch problem and proposed a two-phase solution approach. The two-phase approach consists of an earliest time window insertion heuristic to construct an initial solution followed by move operations cum Tabu search to improve the solution. Experimental results have showed that the two-phase approach is efficient in providing an instantaneous solution. The numerical results also show that by chaining advance-reservation rips, the taxi fleet could be reduced significantly. The main contribution of this study is that a revolutionary system has been proposed for a real-life problem of advance taxi reservation in Singapore that would reduce operating costs and empty cruising time and could be deployed by taxi companies without any extra devices or facilities. Under the proposed system, the benefits for taxi drivers, taxi companies, and customers are summarized as follows: For taxi drivers, there will be an increase in productivity since they can serve more customers with less empty cruising, thus reducing operating cost. The system might also increase taxi driver income by (1) accepting a planned route with multiple advance-reservation trips and (2) having an increase in taxi occupancy time. For taxi companies, the most attractive part is that an increase in resource utilization would be expected. With the same vehicle resource, a taxi company will be able to handle a higher number of advance reservations. In other words, with the same demand level, a taxi company could reduce the number of vehicles in use, which translates into a reduction in inventory cost. With a reduced fee for advance reservations, customers may be more willing to make reservations in advance, thus reducing their transportation expenses and improving travel time reliability. Acknowledgments The authors express their appreciation to the Land Transport Authority of Singapore for providing the O-D data of the CBD area in Singapore. Special thanks are also due to ComfortDelgro Corporation for its assistance in verifying the detailed information about existing taxi operations and dispatch systems in Singapore. References Beaudry, A., G. Laporte, T. Melo, and S. Nickel Dynamic transportation of patients in hospitals. OR Spectrum 32: Borndorfer, R., M. Grotschel, F. Klostermeier, and C. Kuttner Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum fur Informationstechnik Berlin. Cordeau, J. F., and G. Laporte The dial-a-ride problem: Variants, modeling issues and algorithms, Technical Report, ISSN: , Les Cahiers du GERAD, Montreal. Journal of Public Transportation, Vol. 17, No. 3,

13 Gendreau, M., A. Hertz, and G. Laporte A Tabu search heuristic for the vehicle routing problem. Management Science 40: Glover, F., and M. Laguna Tabu Search. Kluwer, Boston, MA. Jorgensen, R. M., J. Larsen, and K. B. Bergvinsdottir Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 58: Lau, H. C., and Z. Liang Pickup and delivery problem with time windows: algorithms and test case generation. International Journal of Artificial Intelligence Tools 11(3): Li, H., and A. Lim A metaheuristic for the pickup and delivery problem with time windows. Proceeding of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 01), Dallas, Texas. Madsen, O.B.G., H. F. Ravn, and J. M. Rygaard A Heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Annals of Operations Research 60: Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2008a. A survey on pickup and delivery problems: Part I: Transportation between customers and depot. Journal für Betriebswirtschaft 58(1), April 2008: 21-51(31). Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2008b. A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery location. Journal für Betriebswirtschaft 58(1), April 2008: (31). Parragh, S. N., K. F. Doerner, R. F. Hartl, and X. Gandibleux A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks 54: Quadstone (2009). Paramics User and Reference Manual, Version Quadstone Ltd., Edinburgh, Scotland. Savelsbergh, M. W. P Local search for routing problems with time windows. Annals of Operations Research 4: Solomon, M. M Algorithms for the vehicle routing and scheduling problems with time window constrains. Operations Research 35: Toth, P., and D. Vigo Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31: Toth, P., and D. Vigo The vehicle routing problem. Philadelphia, USA. William, P. N., and J. W. Barnes Solving the pickup and delivery problem with time windows using Tabu search. Transportation Research 34B: Journal of Public Transportation, Vol. 17, No. 3,

14 About the Authors Hao Wang is an Associate Professor at the Ningbo Institute of Technology, Zhejiang University in China. His research interests include commercial vehicle operations, hub location problems in supply chain systems, and large-scale microscopic traffic simulation. Ruey Long Cheu is an Associate Professor at the University of Texas at El Paso. He serves as an editorial board member of two international journals, Transportation Research Part C: Emerging Technologies and Journal of Intelligent Transportation Systems. His research program at UTEP focuses on border transportation, with emphasis on transportation planning, public transportation, and transportation security. Der-Horng Lee is an Associate Professor at the National University of Singapore. He is an editor for EURO Journal of Transportation and Logistics (Springer) and associate editor for two international referred journals, IEEE Transactions on Intelligent Transportation Systems and IEEE Transactions on Automation Science and Engineering. His specialties include intelligent transportation systems, container port operations, transportation planning and policy, high fidelity traffic and travel simulation, and transportation network modeling and analysis. Journal of Public Transportation, Vol. 17, No. 3,

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February

More information

Fleet Size and Mix Optimization for Paratransit Services

Fleet Size and Mix Optimization for Paratransit Services Fleet Size and Mix Optimization for Paratransit Services Liping Fu and Gary Ishkhanov Most paratransit agencies use a mix of different types of vehicles ranging from small sedans to large converted vans

More information

Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation

Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation Wang, Cheu and Fwa 1 Word Count: 6955 Highway Maintenance Scheduling Using Genetic Algorithm with Microscopic Traffic Simulation Ying Wang Research Scholar Department of Civil Engineering National University

More information

Optimising Patient Transportation in Hospitals

Optimising Patient Transportation in Hospitals Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction

More information

P13 Route Plan. E216 Distribution &Transportation

P13 Route Plan. E216 Distribution &Transportation P13 Route Plan Vehicle Routing Problem (VRP) Principles of Good Routing Technologies to enhance Vehicle Routing Real-Life Application of Vehicle Routing E216 Distribution &Transportation Vehicle Routing

More information

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

More information

Vehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology

Vehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part I: Basic Models and Algorithms Introduction Freight routing

More information

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan International Journal of Applied Operational Research Vol. 3, o. 3, pp. 105-111, Summer 2013 Journal homepage: www.ijorlu.ir Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

More information

Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times

Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times Jean Respen Nicolas Zufferey Jean-Yves Potvin January 2014 Impact of Online Tracking on a Vehicle Routing Problem with Dynamic

More information

Towards Participatory Design of Multi-agent Approach to Transport Demands

Towards Participatory Design of Multi-agent Approach to Transport Demands ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 Towards Participatory Design of Multi-agent Approach to Transport Demands 10 Yee Ming Chen 1, Bo-Yuan Wang Department of Industrial Engineering and Management

More information

Solving a New Mathematical Model for a Periodic Vehicle Routing Problem by Particle Swarm Optimization

Solving a New Mathematical Model for a Periodic Vehicle Routing Problem by Particle Swarm Optimization Transportation Research Institute Iran University of Science and Technology Ministry of Science, Research and Technology Transportation Research Journal 1 (2012) 77-87 TRANSPORTATION RESEARCH JOURNAL www.trijournal.ir

More information

MODELING RICH AND DYNAMIC VEHICLE ROUTING PROBLEMS IN HEURISTICLAB

MODELING RICH AND DYNAMIC VEHICLE ROUTING PROBLEMS IN HEURISTICLAB MODELING RICH AND DYNAMIC VEHICLE ROUTING PROBLEMS IN HEURISTICLAB Stefan Vonolfen (a), Michael Affenzeller (b), Stefan Wagner (c) (a) (b) (c) Upper Austria University of Applied Sciences, Campus Hagenberg

More information

A Microscopic Simulation Modelling of Vehicle Monitoring Using Kinematic Data Based on GPS and ITS Technologies

A Microscopic Simulation Modelling of Vehicle Monitoring Using Kinematic Data Based on GPS and ITS Technologies 1382 JOURNAL OF SOFTWARE, VOL. 9, NO. 6, JUNE 214 A Microscopic Simulation Modelling of Vehicle Monitoring Using Kinematic Data Based on GPS and ITS Technologies Hao Wang Ningbo Institute of Technology,

More information

VEHICLE ROUTING PROBLEM

VEHICLE ROUTING PROBLEM VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem

More information

A tabu search heuristic for the vehicle routing problem with time windows and split deliveries

A tabu search heuristic for the vehicle routing problem with time windows and split deliveries A tabu search heuristic for the vehicle routing problem with time windows and split deliveries Sin C. Ho Dag Haugland Abstract The routing of a fleet of vehicles to service a set of customers is important

More information

The Trip Scheduling Problem

The Trip Scheduling Problem The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems

More information

Vehicle routing problem with time windows and a limited number of vehicles

Vehicle routing problem with time windows and a limited number of vehicles European Journal of Operational Research 148 (2003) 559 569 Discrete Optimization Vehicle routing problem with time windows and a limited number of vehicles Hoong Chuin Lau a, *, Melvyn Sim b, Kwong Meng

More information

Online vehicle routing and scheduling with continuous vehicle tracking

Online vehicle routing and scheduling with continuous vehicle tracking Online vehicle routing and scheduling with continuous vehicle tracking Jean Respen, Nicolas Zufferey, Jean-Yves Potvin To cite this version: Jean Respen, Nicolas Zufferey, Jean-Yves Potvin. Online vehicle

More information

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Thibaut VIDAL LOSI et CIRRELT Université de Technologie de Troyes et Université

More information

Potential Effects of Automatic Vehicle Location and Computer-Aided Dispatch Technology on Paratransit Performance

Potential Effects of Automatic Vehicle Location and Computer-Aided Dispatch Technology on Paratransit Performance Transportation Research Record 1760 107 Paper No. 01-2429 Potential Effects of Automatic Vehicle Location and Computer-Aided Dispatch Technology on Paratransit Performance A Simulation Study Liping Fu

More information

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem Campos,V., Corberán, A., Mota, E. Dep. Estadística i Investigació Operativa. Universitat de València. Spain Corresponding author:

More information

Tabu Search for Optimization of Military Supply Distribution

Tabu Search for Optimization of Military Supply Distribution Tabu Search for Optimization of Military Supply Distribution Abstract Ben Weber Brett Bojduj bgweber@gmail.com bbojduj@calpoly.edu CDM Technologies, Inc. Department of Computer Science 2975 McMillan Ave.

More information

Dynamic transportation of patients in hospitals

Dynamic transportation of patients in hospitals OR Spectrum (2010) 32:77 107 DOI 10.1007/s00291-008-0135-6 REGULAR ARTICLE Dynamic transportation of patients in hospitals Alexandre Beaudry Gilbert Laporte Teresa Melo Stefan Nickel Published online:

More information

VEHICLE ROUTING AND SCHEDULING MODELS, SIMULATION AND CITY LOGISTICS

VEHICLE ROUTING AND SCHEDULING MODELS, SIMULATION AND CITY LOGISTICS VEHICLE ROUTING AND SCHEDULING MODELS, SIMULATION AND CITY LOGISTICS J. Barceló (1), H. Grzybowska (1) and S. Pardo (2) (1) Dept. of Statistics and Operations Research, Universitat Politècnica de Catalunya

More information

Estimation of Travel Demand and Network Simulators to Evaluate Traffic Management Schemes in Disaster

Estimation of Travel Demand and Network Simulators to Evaluate Traffic Management Schemes in Disaster Estimation of Travel Demand and Network Simulators to Evaluate Traffic Management Schemes in Disaster Shinji Tanaka, Masao Kuwahara, Toshio Yoshii, Ryota Horiguchi and Hirokazu Akahane* Institute of Industrial

More information

Hybrid Heterogeneous Electric Fleet Routing Problem with City Center Restrictions

Hybrid Heterogeneous Electric Fleet Routing Problem with City Center Restrictions Hybrid Heterogeneous Electric Fleet Routing Problem with City Center Restrictions Gerhard Hiermann 1, Richard Hartl 2, Jakob Puchinger 1, Thibaut Vidal 3 1 AIT Austrian Institute of Technology 2 University

More information

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok Research Paper Business Analytics Applications for the Vehicle Routing Problem Jelmer Blok Applications for the Vehicle Routing Problem Jelmer Blok Research Paper Vrije Universiteit Amsterdam Faculteit

More information

School-related traffic congestion is a problem in

School-related traffic congestion is a problem in SCHOOL TRANSPORTATION Automated Vehicle Location for School Buses Can the Benefits Influence Choice of Mode for School Trips? TORI D. RHOULAC The author is Assistant Professor, Department of Civil Engineering,

More information

Fifty Years of Vehicle Routing

Fifty Years of Vehicle Routing Fifty Years of Vehicle Routing by Gilbert Laporte Canada Research Chair in Distribution Management HEC Montréal Vehicle Routing Problem Depot m (or at most m) identical vehicles based at the depot n customers

More information

TITLE A CTS FOR THE NEW ROME EXHIBITION

TITLE A CTS FOR THE NEW ROME EXHIBITION CityMobil2 - Socio-economic impact study Reference Group Meeting Lausanne 23 June 2015 TITLE A CTS FOR THE NEW ROME EXHIBITION Carlo Sessa Gabriele Giustiniani, ISIS ITR 30/3/2015 1 Envisioning AUTOMATED

More information

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti

More information

Transportation. Transportation decisions. The role of transportation in the SC. A key decision area within the logistics mix

Transportation. Transportation decisions. The role of transportation in the SC. A key decision area within the logistics mix Transportation A key decision area within the logistics mix Chapter 14 Transportation in the Supply Chain Inventory Strategy Forecasting Storage decisions Inventory decisions Purchasing & supply planning

More information

Transvision Waste Planner

Transvision Waste Planner Transvision Waste Planner Improving waste collection and transport efficiency TRANSVISION WASTE PLANNER facilitates major cost savings and impressive CO 2 emission reductions in your waste collection and

More information

In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic

In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic From: IAAI-99 Proceedings. Copyright 1999, AAAI (www.aaai.org). All rights reserved. In- Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic Robert Kohout and Kutluhan Erol Intelligent

More information

Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods

Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods Kenneth Sörensen 1, Marc Sevaux 2, and Patrick Schittekat 1,3 1 University of Antwerp 2 University of South

More information

FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION

FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION Barceló, Jaume. Department of Statistics and Operations Research and CENIT (Center for Innovation in Transport), Universitat Politècnica de

More information

A Game Theoretic Approach for the Taxi Scheduling Problem with Street Hailing

A Game Theoretic Approach for the Taxi Scheduling Problem with Street Hailing MISTA 2011 A Game Theoretic Approach for the Taxi Scheduling Problem with Street Hailing Ruibin Bai, Jiawei Li, Jason A D Atkin, Graham Kendall Abstract This paper describes a taxi scheduling system to

More information

Available online at www.sciencedirect.com. ScienceDirect. Procedia Computer Science 52 (2015 ) 902 907

Available online at www.sciencedirect.com. ScienceDirect. Procedia Computer Science 52 (2015 ) 902 907 Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 52 (2015 ) 902 907 The 4th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies

More information

Charles Fleurent Director - Optimization algorithms

Charles Fleurent Director - Optimization algorithms Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO

More information

TRANSPORTATION ROUTING MANAGEMENT SOFTWARE REQUEST FOR PROPOSAL SPECIFICATIONS SPECIFICATION DESCRIPTION YES NO COMMENTS

TRANSPORTATION ROUTING MANAGEMENT SOFTWARE REQUEST FOR PROPOSAL SPECIFICATIONS SPECIFICATION DESCRIPTION YES NO COMMENTS GENERAL SYSTEM CHARACTERISTICS The software should be a true Windows Client/Server program. The software should be currently installed and operational under any Microsoft supported Windows operating system.

More information

Parking Management. Index. Purpose. Description. Relevance for Large Scale Events. Options. Technologies. Impacts. Integration potential

Parking Management. Index. Purpose. Description. Relevance for Large Scale Events. Options. Technologies. Impacts. Integration potential Parking Management Index Purpose Description Relevance for Large Scale Events Options Technologies Impacts Integration potential Implementation Best Cases and Examples 1 of 13 Purpose Parking planning

More information

TABU SEARCH FOR OPTIMIZATION OF MILITARY SUPPLY DISTRIBUTION. A Thesis. presented to. the Faculty of. California Polytechnic State University

TABU SEARCH FOR OPTIMIZATION OF MILITARY SUPPLY DISTRIBUTION. A Thesis. presented to. the Faculty of. California Polytechnic State University TABU SEARCH FOR OPTIMIZATION OF MILITARY SUPPLY DISTRIBUTION A Thesis presented to the Faculty of California Polytechnic State University In Partial Fulfillment of the Requirements for the Degree Master

More information

(Adopted October 9, 2007)

(Adopted October 9, 2007) TAXICAB COMPANY STANDARDS RECOMMENDED FOR METROPOLITAN AREAS OF GREATER THAN ONE MILLION POPULATION BY THE TAXICAB, LIMOUSINE & PARATRANSIT ASSOCIATION (Adopted ) Introduction The Taxicab Company Standards

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Intermodal freight transportation describes the movement of goods in standardized loading units (e.g., containers) by at least two transportation modes (rail, maritime, and road)

More information

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Alfredo Olivera, Omar Viera Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Herrera y Reissig

More information

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms Nurse Rostering Jonathan Johannsen CS 537 Scheduling Algorithms Most hospitals worldwide create schedules for their staff by hand, spending hours trying to optimally assign workers to various wards at

More information

CHAPTER 7 DEMAND-RESPONSIVE TRANSIT

CHAPTER 7 DEMAND-RESPONSIVE TRANSIT I Transit Capacity and Quality of Service Manual, 3rd Edition CHAPTER 7 DEMAND-RESPONSIVE TRANSIT 1. User's Guide 2. Mode and Service Concepts 3. Operations Concepts 4. Quality of Service Concepts 5. Quality

More information

A Method for Scheduling Integrated Transit Service

A Method for Scheduling Integrated Transit Service A Method for Scheduling Integrated Transit Service Mark Hickman Department of Civil Engineering and Engineering Mechanics The University of Arizona P.O. Box 210072 Tucson, AZ 85721-0072 USA Phone: (520)

More information

Dynamic Vehicle Routing in MATSim

Dynamic Vehicle Routing in MATSim Poznan University of Technology Department of Motor Vehicles and Road Transport ZPSiTD Dynamic Vehicle Routing in MATSim Simulation and Optimization Michal Maciejewski michal.maciejewski@put.poznan.pl

More information

Shared Mobility Systems. Prof. Ing. Adrian Muscat, University of Malta D-Air Seminar, Intercontinental, St. Julians, Malta

Shared Mobility Systems. Prof. Ing. Adrian Muscat, University of Malta D-Air Seminar, Intercontinental, St. Julians, Malta Shared Mobility Systems D-Air Seminar, Intercontinental, St. Julians, Malta Shared Mobility Making better use of available resources For a better quality of life Transport is a discrete-event on-demand

More information

A Library of Vehicle Routing Problems

A Library of Vehicle Routing Problems A Library of Vehicle Routing Problems Tim Pigden and Optrak Distribution Software Ltd. Tim.Pigden@optrak.com Graham Kendall and The University of Nottingham Malaysia Campus Jalan Broga, 43500 Semenyih

More information

DRAFT. Study to Assess Transportation Options for Delayed High School Start. Guilford Public Schools. Summary of Findings November 2015

DRAFT. Study to Assess Transportation Options for Delayed High School Start. Guilford Public Schools. Summary of Findings November 2015 Study to Assess Transportation Options for Delayed High School Start Guilford Public Schools Summary of Findings November 2015 DRAFT The District Management Council 133 Federal Street, 7 th Floor Boston,

More information

Intermodal Transportation

Intermodal Transportation Intermodal Transportation Teodor Gabriel Crainic ESG UQAM & CIRRELT - CRT CIRRELT Plan What are we talking about? Container-based intermodal transportation System design (location) Fleet Management (empties)

More information

INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014

INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014 INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014 Instructor: E-mail: Office: Office Hours: Dr. Chase Murray All e-mail communication will be handled via Canvas. 3301F Shelby (See Canvas) Teaching

More information

A Task Based Approach for A Real-World Commodity Routing Problem

A Task Based Approach for A Real-World Commodity Routing Problem A Tas Based Approach for A Real-World Commodity Routing Problem Jianjun Chen, Ruibin Bai, Rong Qu and Graham Kendall Division of Computer Science, University of Nottingham Ningbo, China Email: jianjun.chen@nottingham.edu.cn

More information

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Two objective functions for a real life Split Delivery Vehicle Routing Problem International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

More information

Project Management Simulation Environment for Participant-Centered Learning

Project Management Simulation Environment for Participant-Centered Learning Education and Practice Research Statement Dr LEE Wee Leong School of Information Systems, Singapore Management University Tel: (65) 6828-0937; Email: wllee@smu.edu.sg 13 Jan 2015 Background My educational

More information

A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY. Abstract

A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY. Abstract A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY Supanat Suwansusamran 1 and Pornthipa Ongunaru 2 Department of Agro-Industrial Technology,

More information

Legislative Council Secretariat INFORMATION NOTE. Public transport facilities and traffic control measures in Singapore

Legislative Council Secretariat INFORMATION NOTE. Public transport facilities and traffic control measures in Singapore INFORMATION NOTE Public transport facilities and traffic control measures in Singapore 1. Introduction 1.1 Singapore is the first city in the world to make use of Electronic Road Pricing ("ERP") system

More information

Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information

Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering

More information

CORE OBJECTIVES (LTE)

CORE OBJECTIVES (LTE) 1.1 Policy, Regulations & Basics a) Transport policies b) Regulatory framework c) Relevant laws, regulations and ordinances, customs and tariff rules d) Standards and codes of practice e) Design manuals

More information

Martin Savelsbergh. Georgia Institute of Technology. Joint work with Alan Erera, Mike Hewitt, Yang Zhang

Martin Savelsbergh. Georgia Institute of Technology. Joint work with Alan Erera, Mike Hewitt, Yang Zhang Dynamic Load Planning for Less-Than-Truckload Carriers Schneider Professor Georgia Institute of Technology Joint work with Alan Erera, Mike Hewitt, Yang Zhang TRANSLOG, December 10, 2009 Part I: Advances

More information

Transportation Alternatives

Transportation Alternatives 1 Transportation Alternatives Transportation alternatives involve a variety of components: Location Alternatives - when and where service is provided - general location as well as level of service on the

More information

On the Impact of Real-Time Information on. Field Service Scheduling. Ioannis Petrakis, Christian Hass, Martin Bichler 1

On the Impact of Real-Time Information on. Field Service Scheduling. Ioannis Petrakis, Christian Hass, Martin Bichler 1 On the Impact of Real-Time Information on Field Service Scheduling Ioannis Petrakis, Christian Hass, Martin Bichler 1 Department of Informatics, TU München, Germany Mobile phone operators need to plan

More information

Multi-Agent Technology & Scheduling Solutions

Multi-Agent Technology & Scheduling Solutions Multi-Agent Technology & Scheduling Solutions Knowledge Genesis, Ltd Real Time Scheduling Solutions Based on Multi-Agent Technology Prof. Petr Skobelev Knowledge Genesis (Samara, Russia) Founder and Chairman

More information

Backward Scheduling An effective way of scheduling Warehouse activities

Backward Scheduling An effective way of scheduling Warehouse activities Backward Scheduling An effective way of scheduling Warehouse activities Traditionally, scheduling algorithms were used in capital intensive production processes where there was a need to optimize the production

More information

Getting to and from Bengaluru International Airport

Getting to and from Bengaluru International Airport Getting to and from Bengaluru International For more information, visit our website www.bengaluruairport.com For any feedback, email feedback@bialairport.com Bengaluru International, Bangalore 560 300

More information

Real-Life Vehicle Routing with Non-Standard Constraints

Real-Life Vehicle Routing with Non-Standard Constraints , July 3-5, 203, London, U.K. Real-Life Vehicle Routing with n-standard Constraints W. L. Lee Abstract Real-life vehicle routing problems comprise of a number of complexities that are not considered by

More information

SUSTAINABLE DEVELOPMENT TECHNOLOGY CANADA Travel & Accommodation Expense Guidelines and Policy

SUSTAINABLE DEVELOPMENT TECHNOLOGY CANADA Travel & Accommodation Expense Guidelines and Policy SUSTAINABLE DEVELOPMENT TECHNOLOGY CANADA Travel & Accommodation Expense Guidelines and Policy Purpose The purpose of this policy is to establish equitable standards and provide fair and consistent treatment

More information

Simulating Traffic for Incident Management and ITS Investment Decisions

Simulating Traffic for Incident Management and ITS Investment Decisions 1998 TRANSPORTATION CONFERENCE PROCEEDINGS 7 Simulating Traffic for Incident Management and ITS Investment Decisions MICHAEL D. ANDERSON AND REGINALD R. SOULEYRETTE UTPS-type models were designed to adequately

More information

Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business

Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business 0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite

More information

Mathematical Programming Guides Air-Ambulance Routing at Ornge

Mathematical Programming Guides Air-Ambulance Routing at Ornge INTERFACES Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 issn 0092-2102 eissn 1526-551X 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Mathematical Programming Guides Air-Ambulance Routing at

More information

Optimization of patient transport dispatching in hospitals

Optimization of patient transport dispatching in hospitals Optimization of patient transport dispatching in hospitals Cyrille Lefèvre and Sophie Marquet Supervisors: Yves Deville and Gildas Avoine 1500 minutes Thesis motivation MedSoc NPO asked us to conduct a

More information

Scheduling and Routing Milk from Farm to Processors by a Cooperative

Scheduling and Routing Milk from Farm to Processors by a Cooperative Journal of Agribusiness 22,2(Fall 2004):93S106 2004 Agricultural Economics Association of Georgia Scheduling and Routing Milk from Farm to Processors by a Cooperative Peerapon Prasertsri and Richard L.

More information

INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS

INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS SUPPLY CHAIN FOR ENERGY PRODUCTION Tatiana M. Pinho 1,2, Bruno Oliveira 2, Dmitry Podpokaev 3, Jussi Rasinmäki 3, Alexandra Marques 2, J. Boaventura-Cunha

More information

Vehicle routing in a Spanish distribution company: Saving using a savings-based heuristic

Vehicle routing in a Spanish distribution company: Saving using a savings-based heuristic Original Article Vehicle routing in a Spanish distribution company: Saving using a savings-based heuristic Alex Grasas a, *, Jose Caceres-Cruz b, Helena R. Lourenc o a, Angel A. Juan b and Mercè Roca c

More information

Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport

Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport Michael Drexl, Researcher at Chair of Logistics Management, Gutenberg School of Management and

More information

Fleet Optimization with IBM Maximo for Transportation

Fleet Optimization with IBM Maximo for Transportation Efficiencies, savings and new opportunities for fleet Fleet Optimization with IBM Maximo for Transportation Highlights Integrates IBM Maximo for Transportation with IBM Fleet Optimization solutions Offers

More information

On-Line and Off-Line Routing and Scheduling of Dial-a-Ride Paratransit Vehicles

On-Line and Off-Line Routing and Scheduling of Dial-a-Ride Paratransit Vehicles Computer-Aided Civil and Infrastructure Engineering 14 (1999) 309 319 On-Line and Off-Line Routing and Scheduling of Dial-a-Ride Paratransit Vehicles Liping Fu Department of Civil Engineering, University

More information

Traffic Simulation Modeling: VISSIM. Koh S.Y Doina 1 and Chin H.C 2

Traffic Simulation Modeling: VISSIM. Koh S.Y Doina 1 and Chin H.C 2 Traffic Simulation Modeling: VISSIM Koh S.Y Doina 1 and Chin H.C 2 Faculty of Engineering, Civil Engineering Department, National University of Singapore ABSTRACT This Undergraduate Research Opportunity

More information

Tactical Routing. The leading solution for optimizing your transport on a tactical level

Tactical Routing. The leading solution for optimizing your transport on a tactical level Tactical Routing The leading solution for optimizing your transport on a tactical level How do we deploy our company fleet with optimal efficiency? Challenges The supply chain sector is currently under

More information

GLOSSARY of Paratransit Terms

GLOSSARY of Paratransit Terms Innovation in Transit GLOSSARY of Paratransit Terms January 2007 FORWARD: ABOUT PACE PARATRANSIT SERVICES Pace provides a variety of public transportation services. ADA Paratransit, which operates in the

More information

From Big Data to Smart Data How to improve public transport through modelling and simulation.

From Big Data to Smart Data How to improve public transport through modelling and simulation. From Big Data to Smart Data How to improve public transport through modelling and simulation. Dr. Alex Erath, Pieter Fourie, Sergio Ordó ~ nez, Artem Chakirov FCL Research Module: Mobility and Transportation

More information

The New Mobility: Using Big Data to Get Around Simply and Sustainably

The New Mobility: Using Big Data to Get Around Simply and Sustainably The New Mobility: Using Big Data to Get Around Simply and Sustainably The New Mobility: Using Big Data to Get Around Simply and Sustainably Without the movement of people and goods from point to point,

More information

A Road Timetable TM to aid vehicle routing and scheduling

A Road Timetable TM to aid vehicle routing and scheduling Computers & Operations Research 33 (2006) 3508 3519 www.elsevier.com/locate/cor A Road Timetable TM to aid vehicle routing and scheduling Richard Eglese a,, Will Maden a, Alan Slater b a Department of

More information

VEHICLE ROUTING PROBLEMS IN CONGESTED URBAN AREAS

VEHICLE ROUTING PROBLEMS IN CONGESTED URBAN AREAS VEHICLE ROUTING PROBLEMS IN CONGESTED URBAN AREAS Miguel A. Figliozzi Civil and Environmental Engineering Portland State University figliozzi@pdx.edu 1 Outline The Vehicle Routing Problem (VRP) VRP in

More information

Intelligent Transportation Solutions for Sustainable City Logistics: Issues and Prospects

Intelligent Transportation Solutions for Sustainable City Logistics: Issues and Prospects TRANSPORTATION CENTER NORTHWESTERN UNIVERSITY Intelligent Transportation Solutions for Sustainable City Logistics: Issues and Prospects Hani S. Mahmassani LOGISTICS part of the supply chain process that

More information

Improvement in Transit Service using GIS Case study of Bhavnagar State Transport Depot

Improvement in Transit Service using GIS Case study of Bhavnagar State Transport Depot Improvement in Transit Service using GIS Case study of Bhavnagar State Transport Depot Mukti Advani Research Scholar, TRIPP/IIT Delhi B.Srirama Research Scientist, TRIPP/IIT Delhi S.K.Pathan Head, LPPD,

More information

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Mauricio Acuna Harvesting and Operations Program CRC for Forestry

More information

How To Plan A City Of Korea

How To Plan A City Of Korea TRANSCAD MODELING AT NCTCOG: WHAT WE NOW HAVE For UT-Austin/NCTCOG Meeting January 28, 2004 AGENDA Background Modeling Environment Trip Generation And Distribution Transit Skims Mode Choice Transit And

More information

Real Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging

Real Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging Real Time Bus Monitoring System by Sharing the Location Using Google Cloud Server Messaging Aravind. P, Kalaiarasan.A 2, D. Rajini Girinath 3 PG Student, Dept. of CSE, Anand Institute of Higher Technology,

More information

Unifying the Private Fleet with Purchased Transportation

Unifying the Private Fleet with Purchased Transportation Unifying the Private Fleet with Purchased Transportation Achieving Lower Costs and Higher Service via Dynamic, Omni-Mode Integration of Private Fleet with For Hire Operations Sponsored by: The Descartes

More information

A Guide to Planning One-Call Services. Simplifying Access to Transportation Services & Information

A Guide to Planning One-Call Services. Simplifying Access to Transportation Services & Information A Guide to Planning One-Call Services Simplifying Access to Transportation Services & Information Today s Session Presentation of project process & results Discussion: What is your experience? Currently

More information

Proposed Advance Taxi Recommender System Based On a Spatiotemporal Factor Analysis Model

Proposed Advance Taxi Recommender System Based On a Spatiotemporal Factor Analysis Model Proposed Advance Taxi Recommender System Based On a Spatiotemporal Factor Analysis Model Santosh Thakkar, Supriya Bhosale, Namrata Gawade, Prof. Sonia Mehta Department of Computer Engineering, Alard College

More information

Inventory Routing. An advanced solution for demand forecasting, stock replenishment, and route planning and execution

Inventory Routing. An advanced solution for demand forecasting, stock replenishment, and route planning and execution Inventory Routing An advanced solution for demand forecasting, stock replenishment, and route planning and execution Our solution delivers a competitive advantage that goes beyond the capabilities of ERP,

More information

Load Planning for Less-than-truckload Carriers. Martin Savelsbergh

Load Planning for Less-than-truckload Carriers. Martin Savelsbergh Load Planning for Less-than-truckload Carriers Martin Savelsbergh Centre for Optimal Planning and Operations School of Mathematical and Physical Sciences University of Newcastle Optimisation in Industry,

More information

VENDOR MANAGED INVENTORY

VENDOR MANAGED INVENTORY VENDOR MANAGED INVENTORY Martin Savelsbergh School of Industrial and Systems Engineering Georgia Institute of Technology Joint work with Ann Campbell, Anton Kleywegt, and Vijay Nori Distribution Systems:

More information

How To Understand The Relationship Between A Line And A Passenger Car

How To Understand The Relationship Between A Line And A Passenger Car MESTRADO INTEGRADO DE ENGENHARIA CIVIL MESTRADO EM URBANISMO E ORDENAMENTO DO TERRITÓRIO MESTRADO EM PLANEAMENTO E OPERAÇÃO DE TRANSPORTES LICENCIATURA EM ENGENHARIA DO TERRITÓRIO Course: Urban Mobility

More information

APPENDIX A Dallas-Fort Worth Region Transportation System Management Strategies and Projects

APPENDIX A Dallas-Fort Worth Region Transportation System Management Strategies and Projects APPENDIX A Transportation System Management Strategies and Projects Transportation System Transportation System Management Projects Management Strategies Traffic Signalization and Control New Signal Installation

More information

Use of System Dynamics for modelling customers flows from residential areas to selling centers

Use of System Dynamics for modelling customers flows from residential areas to selling centers Use of System Dynamics for modelling customers flows from residential areas to selling centers ENRICO BRIANO (*) CLAUDIA CABALLINI (*)(**) ROBERTO REVETRIA (*)(**) MAURIZIO SCHENONE (**) ALESSANDRO TESTA

More information