The design of Demand-Adaptive public transportation Systems: Meta-Schedules
|
|
- Richard Lawrence
- 5 years ago
- Views:
Transcription
1 The design of Demand-Adaptive public transportation Systems: Meta-Schedules Gabriel Teodor Crainic Fausto Errico ESG, UQAM and CIRRELT, Montreal Federico Malucelli DEI, Politecnico di Milano Maddalena Nonato Università di Ferrara JOURNE SCIENTIFIQUE Chaire de recherche industrielle CRSNG en management logistique ESG UQAM The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.1/29
2 Outline 1. Demand Responsive transit Systems (e.g., DAR) 2. Demand Adaptive transit Systems (DAS) 3. Scheduling issues in DAS, DAR, and Traditional transit 4. The Meta-Schedule problem single segment subproblem - sampling-based technique sewing segments together 5. Conclusions The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.2/29
3 Flexibility in Transit Systems Offer competitive transportation services Capture additional demand Better address population needs Cover larger/additional areas Sustainability Reduce operating costs Increase resource utilization Integration with traditional transportation systems User point of view Management point of view The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.3/29
4 Dial a Ride Systems Users ask for personalized rides (door-to-door service) But are served collectively Similar to a collective taxi service Initially devised to meet needs of users with reduced mobility Extended (somewhat) to deal with low demand areas or periods Quite expensive compared to regular service Frequency? Regularity? The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.4/29
5 Demand Adaptive System (DAS) Combine DAR flexibility to traditional system regularity and low-cost Compulsory stops with time windows regular line Optional stops on request (active users) Segments: Set of optional stops between two consecutive compulsory stops Users can still access the service at compulsory stops (passive users) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.5/29
6 A DAS line Passive users only The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.6/29
7 A DAS line Active and passive users The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.7/29
8 Integrated System DAS as feeder lines The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.8/29
9 Multiple Lines Transfer points among flexible (and traditional) lines (compulsory stops) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.9/29
10 Schedules: Traditional Transit and DAR Traditional Transit Passing time at each stop of the line Designed for medium-term periods (six months, one year) Users plan their trips based on published schedules Tactical planning decision (line definition: higher level ) DAR Particular to each vehicle tour Varying according to the actual requests Operational planning activity The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.10/29
11 Scheduling Issues for DAS Combines planning phases of traditional transit and DAR Two schedules are built Meta-Schedule: Similar to Traditional Transit Basic line definition: time windows at compulsory stops Users plan trips based on the published Meta-Schedule Tactical planning decision (compulsory stops, segments, frequencies at higher level) Each departure schedule: Similar to DAR Defines the actual vehicle itinerary Varies according to actual requests Must be compatible with the Master Schedule Operational planning activity The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.11/29
12 Basic DAS Design Problem Input The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
13 Basic DAS Design Problem Input Region to serve The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
14 Basic DAS Design Problem Input Region to serve Demand The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
15 Basic DAS Design Problem Input Region to serve Demand Decisions The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
16 Basic DAS Design Problem Input Region to serve Demand Decisions Compulsory stops The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
17 Basic DAS Design Problem Input Region to serve Demand Decisions Compulsory stops Sequencing The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
18 Basic DAS Design Problem Input Region to serve Demand Decisions Compulsory stops Sequencing Segments The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
19 Basic DAS Design Problem Input Region to serve Demand Decisions Compulsory stops Sequencing Segments Time windows The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
20 Basic DAS Design Problem Input Region to serve Demand Decisions Compulsory stops Sequencing Segments Time windows Goals Low routing costs Hight level of service The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.12/29
21 Time Windows The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
22 Time Windows Policy Given a compulsory stop and its time window [a, b] The Vehicle Must leave the compulsory stop within the time interval [a, b] May arrive before a a b The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
23 Time Windows Consequences Passive users must be at the compulsory stop not later than a Passengers on the bus may experience idle times Time windows represent bounds on user travel time a b The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
24 Time Windows Main Features Distance Width distance width width time The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
25 Time Windows Main Features Distance Time to serve the optional stop Idle times at compulsory stops Width distance width width time The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
26 Time Windows Main Features Distance Time to serve the optional stop Idle times at compulsory stops Width Flexibility Long waiting times for passive users distance width width time The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.13/29
27 Meta-Schedule: problem description Input Topological design Demand for transportation Policy for time windows The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.14/29
28 Meta-Schedule: problem description Input Topological design Demand for transportation Policy for time windows Output A time window for each compulsory stop The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.14/29
29 Meta-Schedule: problem description Input Topological design Demand for transportation Policy for time windows Output A time window for each compulsory stop Conflicting goals Provide sufficient time to serve optional stops Minimize total maximum time Small time windows Minimize idle times... The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.14/29
30 Problem Setting and Assumptions The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.15/29
31 Problem Setting and Assumptions Demand Probability distributions of requests for o/d pairs Probability of at least one request derived for each optional stop Serve the set of requests Serve the set of requested stops The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.15/29
32 Problem Setting and Assumptions Demand Probability distributions of requests for o/d pairs Probability of at least one request derived for each optional stop Serve the set of requests Serve the set of requested stops Time windows We consider time windows with common and fixed width δ Two possible easy extensions Fixed but different width Maximum width The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.15/29
33 Formaly Input A sequence of compulsory stops A set of optional stops partitioned into segments Travel time c ij for the pair of stops (i, j) in a segment Probability p i of being requested for service for optional stop i The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.16/29
34 Formaly Input A sequence of compulsory stops A set of optional stops partitioned into segments Travel time c ij for the pair of stops (i, j) in a segment Probability p i of being requested for service for optional stop i Output Time windows [a h, b h ] for compulsory stop f h, b h a h = δ It reduces to finding a sequence {b 0, b 1,...,b n } The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.16/29
35 Formaly Input A sequence of compulsory stops A set of optional stops partitioned into segments Travel time c ij for the pair of stops (i, j) in a segment Probability p i of being requested for service for optional stop i Output Time windows [a h, b h ] for compulsory stop f h, b h a h = δ It reduces to finding a sequence {b 0, b 1,...,b n } Goals Serve any requested optional stop with probability P ǫ Minimize b n The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.16/29
36 Subproblem: Single Segment f h 1 f h Input A segment The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
37 Subproblem: Single Segment f h 1 p i f h Input A segment Probability p i for optional stop i of being active The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
38 Subproblem: Single Segment f h 1 p i f h L h 1 Input A segment Probability p i for optional stop i of being active The departure time L h 1 at compulsory f h 1 The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
39 Subproblem: Single Segment f h 1 p i f h L h 1 Sh p Sh To any subset S h N h of optional stops is associated Probability p Sh of being active The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
40 Subproblem: Single Segment f h 1 p i f h L h 1 Sh p Sh T h = H h + L h 1 To any subset S h N h of optional stops is associated Probability p Sh of being active Service Time H h (active set) Hamiltonian Path? Arrival Time T h at the second compulsory f h The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
41 Subproblem: Single Segment f h 1 p i f h L h 1 Sh p Sh T h = H h + L h 1 To any subset S h N h of optional stops is associated Probability p Sh of being active Service Time H h (active set) Hamiltonian Path? Arrival Time T h at the second compulsory f h H h and T h are random variables The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
42 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Goal The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
43 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Goal Find the smallest value b h such that b h T h (ω) with probability 1 ǫ (to guarantee good service) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
44 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Goal Find the smallest value b h such that b h T h (ω) with probability 1 ǫ (to guarantee good service) We take b h = T 1 ǫ h P{H h (w) H 1 ǫ h = H 1 ǫ h + L h 1, with T 1 ǫ h, H 1 ǫ h } 1 ǫ and P{T h (w) T 1 ǫ h defined as } 1 ǫ The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
45 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Crucial Point The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
46 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Crucial Point How do we compute T 1 ǫ h or H 1 ǫ h (they differ by a constant)? The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
47 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Crucial Point How do we compute T 1 ǫ h or H 1 ǫ h (they differ by a constant)? Cumulative Distribution Function (CDF) and Probability Mass Function (PMF) for H h (ω) and T h (ω) are needed The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
48 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Crucial Point How do we compute T 1 ǫ h or H 1 ǫ h (they differ by a constant)? Cumulative Distribution Function (CDF) and Probability Mass Function (PMF) for H h (ω) and T h (ω) are needed Requires 2 N h service-time evaluations! The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
49 Subproblem: Single Segment f h 1 p i f h L h 1 S h (ω) T h (ω) = H h (ω) + L h 1 Crucial Point How do we compute T 1 ǫ h or H 1 ǫ h (they differ by a constant)? Cumulative Distribution Function (CDF) and Probability Mass Function (PMF) for H h (ω) and T h (ω) are needed Requires 2 N h service-time evaluations! We estimate the PMF by sampling The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.17/29
50 Sampling Algorithm Take {r 1, r 2,...,r l } random samples of relatively small cardinality Compute the PMF k, CDF k, and b k h for each sample r k Compute the mean value and standard deviation of b k h If the standard deviation is small, i.e.,the solution is precise, stop Otherwise, increment the cardinality of the samples and iterate The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.18/29
51 Sampling Algorithm Take {r 1, r 2,...,r l } random samples of relatively small cardinality Compute the PMF k, CDF k, and b k h for each sample r k Compute the mean value and standard deviation of b k h If the standard deviation is small, i.e.,the solution is precise, stop Otherwise, increment the cardinality of the samples and iterate Observations The algorithm is very simple. But No guarantee of unbiased solution The dimension of the sample may become critical The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.18/29
52 Experimentation Focus on the estimation of the service time for a single segment Square-shaped segments, side length 300 Compulsory stops at the extremities of one diagonal Optional stops are uniformly distributed on the square To each optional stop is associated a positive probability, 50% in average P ǫ = 0.95 Hamiltonian Path computed by our basic B&C code The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.19/29
53 Results A20 Longest 1-Path Hamiltonian Path Real b h (ε) Dim. nsamples dimsamples bh (ε) Std-dev/ b h (ε) Time(sec.) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.20/29
54 Results A30 Longest 1-Path Hamiltonian Path Real b h (ε) Dim. nsamples dimsamples bh (ε) Std-dev/ b h (ε) Time(sec.) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.21/29
55 Results A40 Longest 1-Path Hamiltonian Path Real b h (ε) Dim. nsamples dimsamples bh (ε) Std-dev/ b h (ε) Time(sec.) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.22/29
56 Results A50 Longest 1-Path Hamiltonian Path Real b h (ε) Dim. nsamples dimsamples bh (ε) Std-dev/ b h (ε) Time(sec.) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.23/29
57 Conclusions (1) The algorithm for estimating time windows is fast The number of samplings is not very important The cardinality of samples is important. Around 200 Method successful in solving problems with high dimension The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.24/29
58 Sewing Segments We introduce a new random variable The vehicle departure time L h (ω) at compulsory stop f h where a h L h (ω) b h T h (ω) = L h 1 (ω) + H h (ω) needed to compute [a h, b h ] T h (ω) and L h (ω) are linked by the relation L h (ω) = T h (ω) if ω a h T h (ω) b h ; a h if ω T h (ω) < a h ; b h if ω T h (ω) > b h. Observe that L h 1 (ω) and H h (ω) are independent T h (ω) can be computed by convoluting L h 1 (ω) and H h (ω) The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.25/29
59 Complete Scheme Input Sequence of segments G = 1,2,...,n G h Service probability P ǫ = (1 ǫ) n The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.26/29
60 Complete Scheme Input Sequence of segments G = 1,2,...,n G h Service probability P ǫ = (1 ǫ) n Algorithm 1. For each segment G h, h {1, 2,...,n} (a) Compute PMF and CDF of L h 1 (ω) (b) Compute PMF and CDF of H h (ω) (c) Compute PMF and CDF of T h (ω) as the convolution of the PMFs of L h 1 and H h (d) Compute T 1 ǫ h and set b h = T 1 ǫ h. The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.26/29
61 Complete Scheme Input Sequence of segments G = 1,2,...,n G h Service probability P ǫ = (1 ǫ) n Algorithm 1. For each segment G h, h {1, 2,...,n} (a) Compute PMF and CDF of L h 1 (ω) (b) Compute PMF and CDF of H h (ω) (c) Compute PMF and CDF of T h (ω) as the convolution of the PMFs of L h 1 and H h (d) Compute T 1 ǫ h Output and set b h = T 1 ǫ h. The best sequence {b 1, b 2,...,b n } Such that any randomly requested optional stop is served with probability P ǫ The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.26/29
62 Experimentation Goal evaluate the quality of the produced master schedules Given several: topological DAS line design origin destination demand distributions Compute several master schedules varying: time window width δ probabilities ǫ Simulate operations monitoring: percentage of rejected requests passive user waiting times idle times at compulsory... The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.27/29
63 Results ǫ δ b 4 avg(r/t) stdv(r/t) avg(i) stdv(i) avg(p) stdv(p) Master schedule evaluated on 4-segment line, low and high demand, 100 realizations The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.28/29
64 Conclusions (2) Demand Adaptive transit Systems DAS scheduling different from DAR and traditional transit The Meta-Schedule problem May be efficiently addressed by sampling (single segment) Results for general framework are satisfactory under different demand and line scenarios The design of Demand-Adaptive public transportation Systems: Meta-Schedules p.29/29
Viable and Sustainable Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Viable and Sustainable Transportation Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Viability and Sustainability In this lecture, the fundamental
More informationVehicle 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 II: Algorithmic Enhancements Handling Practical Complexities
More informationSupplementary Technical Details and Results
Supplementary Technical Details and Results April 6, 2016 1 Introduction This document provides additional details to augment the paper Efficient Calibration Techniques for Large-scale Traffic Simulators.
More informationModels and Cuts for the Two-Echelon Vehicle Routing Problem
Models and Cuts for the Two-Echelon Vehicle Routing Problem Guido Perboli Roberto Tadei Francesco Masoero Department of Control and Computer Engineering, Politecnico di Torino Corso Duca degli Abruzzi,
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Sito web: http://home.deib.polimi.it/amaldi/ott-13-14.shtml A.A. 2013-14 Edoardo
More informationA Column Generation Based Heuristic for the Dial-A-Ride Problem
A Column Generation Based Heuristic for the Dial-A-Ride Problem Nastaran Rahmani 1, Boris Detienne 2,3, Ruslan Sadykov 3,2, François Vanderbeck 2,3 1 Kedge Business School, 680 Cours de la Libération,
More informationTrip Distribution Modeling Milos N. Mladenovic Assistant Professor Department of Built Environment
Trip Distribution Modeling Milos N. Mladenovic Assistant Professor Department of Built Environment 25.04.2017 Course Outline Forecasting overview and data management Trip generation modeling Trip distribution
More informationService Capacity Design Problems for Mobility Allowance Shuttle Transit Systems
Service Capacity Design Problems for Mobility Allowance Shuttle Transit Systems Jiamin Zhao Oracle Corporation Redwood Shores, CA 94065 jiamin.zhao.zhao@oracle.com Maged Dessouky* Daniel J. Epstein Department
More informationA Benders Decomposition Approach for the Symmetric TSP with Generalized Latency
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Fausto Errico Teodor Gabriel Crainic Federico Malucelli Maddalena Nonato December 2012 Bureaux de Montréal : Bureaux de Québec
More informationAuthor's Personal Copy
An Analytical Model to Select the Fleet Size for MAST Systems Wei u, Yuanchang Xie, Wen Wang and uca Quadrifoglio Abstract The mobility allowance shuttle transit (MAST) system is a hybrid transit system
More informationChapter 3: Discrete Optimization Integer Programming
Chapter 3: Discrete Optimization Integer Programming Edoardo Amaldi DEIB Politecnico di Milano edoardo.amaldi@polimi.it Website: http://home.deib.polimi.it/amaldi/opt-16-17.shtml Academic year 2016-17
More informationAn integrated schedule planning and revenue management model
An integrated schedule planning and revenue management model Bilge Atasoy Michel Bierlaire Matteo Salani LATSIS - 1 st European Symposium on Quantitative Methods in Transportation Systems September 07,
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More information2 GRAPH AND NETWORK OPTIMIZATION. E. Amaldi Introduction to Operations Research Politecnico Milano 1
2 GRAPH AND NETWORK OPTIMIZATION E. Amaldi Introduction to Operations Research Politecnico Milano 1 A variety of decision-making problems can be formulated in terms of graphs and networks Examples: - transportation
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement Wyean Chan DIRO, Université de Montréal, C.P. 6128, Succ. Centre-Ville, Montréal (Québec), H3C 3J7, CANADA,
More informationDynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement
Submitted to imanufacturing & Service Operations Management manuscript MSOM-11-370.R3 Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times Online Supplement (Authors names blinded
More informationSPACE-TIME ACCESSIBILITY MEASURES FOR EVALUATING MOBILITY-RELATED SOCIAL EXCLUSION OF THE ELDERLY
SPACE-TIME ACCESSIBILITY MEASURES FOR EVALUATING MOBILITY-RELATED SOCIAL EXCLUSION OF THE ELDERLY Izumiyama, Hiroshi Institute of Environmental Studies, The University of Tokyo, Tokyo, Japan Email: izumiyama@ut.t.u-tokyo.ac.jp
More informationMULTI-VEHICLE MOBILITY ALLOWANCE SHUTTLE TRANSIT (MAST) SYSTEM - AN ANALYTICAL MODEL TO SELECT THE FLEET SIZE AND A SCHEDULING HEURISTIC.
MULTI-VEHICLE MOBILITY ALLOWANCE SHUTTLE TRANSIT (MAST) SYSTEM - AN ANALYTICAL MODEL TO SELECT THE FLEET SIZE AND A SCHEDULING HEURISTIC A Thesis by WEI LU Submitted to the Office of Graduate Studies of
More informationSCHEDULING PROBLEMS FOR FRACTIONAL AIRLINES
SCHEDULING PROBLEMS FOR FRACTIONAL AIRLINES A Thesis Presented to The Academic Faculty by Fei Qian In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the H. Milton Stewart
More informationTraffic Demand Forecast
Chapter 5 Traffic Demand Forecast One of the important objectives of traffic demand forecast in a transportation master plan study is to examine the concepts and policies in proposed plans by numerically
More informationFundamental Characteristics of Urban Transportation Services
Fundamental Characteristics of Urban Transportation Services Anton J. Kleywegt School of Industrial and Systems Engineering Georgia Institute of Technology Smart Urban Transportation Forum Institute for
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making (discrete optimization) problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock,
More informationExtracting mobility behavior from cell phone data DATA SIM Summer School 2013
Extracting mobility behavior from cell phone data DATA SIM Summer School 2013 PETER WIDHALM Mobility Department Dynamic Transportation Systems T +43(0) 50550-6655 F +43(0) 50550-6439 peter.widhalm@ait.ac.at
More informationIntegrated schedule planning with supply-demand interactions for a new generation of aircrafts
Integrated schedule planning with supply-demand interactions for a new generation of aircrafts Bilge Atasoy, Matteo Salani and Michel Bierlaire Abstract We present an integrated schedule planning model
More informationA Joint Tour-Based Model of Vehicle Type Choice and Tour Length
A Joint Tour-Based Model of Vehicle Type Choice and Tour Length Ram M. Pendyala School of Sustainable Engineering & the Built Environment Arizona State University Tempe, AZ Northwestern University, Evanston,
More informationVehicle Scheduling for Accessible. Transportation Systems
Beauchamp 1 2 Furkan Enderer 3 Mounira Groiez 1 Nadia Lahrichi 1 Mehdi Mahnam 1 Odile Marcotte 4 Sofiane Soualah 5 6 1 École Polytechnique 2 UQAM 3 Concordia University 4 CRM and UQAM 5 Université de Montréal
More informationVehicle dispatching with time-dependent travel times
European Journal of Operational Research 144 (2003) 379 396 Discrete Optimization Vehicle dispatching with time-dependent travel times Soumia Ichoua a,b, Michel Gendreau a,b, Jean-Yves Potvin a,b, * www.elsevier.com/locate/dsw
More informationFinal Report. Multi-vehicle Mobility Allowance Shuttle Transit (MAST) System: An Analytical Model to Select the Fleet Size and a Scheduling Heuristic
Improving the Quality of Life by Enhancing Mobility University Transportation Center for Mobility DOT Grant No. DTRT06-G-0044 Multi-vehicle Mobility Allowance Shuttle Transit (MAST) System: An Analytical
More informationSurge Pricing and Labor Supply in the Ride- Sourcing Market
Surge Pricing and Labor Supply in the Ride- Sourcing Market Yafeng Yin Professor Department of Civil and Environmental Engineering University of Michigan, Ann Arbor *Joint work with Liteng Zha (@Amazon)
More informationTHE PICKUP AND DELIVERY PROBLEM WITH TRANSFERS: FORMULATION AND A BRANCH-AND-CUT SOLUTION METHOD
THE PICKUP AND DELIVERY PROBLEM WITH TRANSFERS: FORMULATION AND A BRANCH-AND-CUT SOLUTION METHOD Abstract. In this paper, a strict formulation of a generalization of the classical pick up and delivery
More informationTravel and Transportation
A) Locations: B) Time 1) in the front 4) by the window 7) earliest 2) in the middle 5) on the isle 8) first 3) in the back 6) by the door 9) next 10) last 11) latest B) Actions: 1) Get on 2) Get off 3)
More information7 Variance Reduction Techniques
7 Variance Reduction Techniques In a simulation study, we are interested in one or more performance measures for some stochastic model. For example, we want to determine the long-run average waiting time,
More informationThe Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs
The Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs Models and Heuristics Ilaria Vacca Transport and Mobility Laboratory, EPFL joint work with Matteo Salani,
More informationA HYBRID FIXED AND FLEXIBLE TRANSPORTATION SERVICE: DESCRIPTION, VIABILITY, FORMULATION, OPTIMIZATION AND HEURISTIC.
A HYBRID FIXED AND FLEXIBLE TRANSPORTATION SERVICE: DESCRIPTION, VIABILITY, FORMULATION, OPTIMIZATION AND HEURISTIC Copyright 2005 by Luca Quadrifoglio A Dissertation Presented to the FACULTY OF THE GRADUATE
More information3.10 Column generation method
3.10 Column generation method Many relevant decision-making problems can be formulated as ILP problems with a very large (exponential) number of variables. Examples: cutting stock, crew scheduling, vehicle
More informationROUNDTABLE ON SOCIAL IMPACTS OF TIME AND SPACE-BASED ROAD PRICING Luis Martinez (with Olga Petrik, Francisco Furtado and Jari Kaupilla)
ROUNDTABLE ON SOCIAL IMPACTS OF TIME AND SPACE-BASED ROAD PRICING Luis Martinez (with Olga Petrik, Francisco Furtado and Jari Kaupilla) AUCKLAND, NOVEMBER, 2017 Objective and approach (I) Create a detailed
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 9 Verification and Validation of Simulation Models Purpose & Overview The goal of the validation process is: To produce a model that represents true
More informationContinuous Random Variables
1 Continuous Random Variables Example 1 Roll a fair die. Denote by X the random variable taking the value shown by the die, X {1, 2, 3, 4, 5, 6}. Obviously the probability mass function is given by (since
More informationScheduling Lecture 1: Scheduling on One Machine
Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer
More informationContinuous Random Variables
Contents IV Continuous Random Variables 1 13 Introduction 1 13.1 Probability Mass Function Does Not Exist........................... 1 13.2 Probability Distribution.....................................
More informationTRAVELING SALESMAN PROBLEM WITH TIME WINDOWS (TSPTW)
TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS (TSPTW) Aakash Anuj 10CS30043 Surya Prakash Verma 10AE30026 Yetesh Chaudhary 10CS30044 Supervisor: Prof. Jitesh Thakkar TSP Given a list of cities and the distances
More informationLecture 4: Bernoulli Process
Lecture 4: Bernoulli Process Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 4 Hyang-Won Lee 1 / 12 Stochastic Process A stochastic process is a mathematical model of a probabilistic
More informationThe prediction of passenger flow under transport disturbance using accumulated passenger data
Computers in Railways XIV 623 The prediction of passenger flow under transport disturbance using accumulated passenger data T. Kunimatsu & C. Hirai Signalling and Transport Information Technology Division,
More informationCharacterizing Travel Time Reliability and Passenger Path Choice in a Metro Network
Characterizing Travel Time Reliability and Passenger Path Choice in a Metro Network Lijun SUN Future Cities Laboratory, Singapore-ETH Centre lijun.sun@ivt.baug.ethz.ch National University of Singapore
More informationCHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS
CHAPTER 3. CAPACITY OF SIGNALIZED INTERSECTIONS 1. Overview In this chapter we explore the models on which the HCM capacity analysis method for signalized intersections are based. While the method has
More informationA STUDY OF REALISTIC AND INNOVATIVE FEATURES OF THE SCHOOL BUS ROUTING PROBLEM
A STUDY OF REALISTIC AND INNOVATIVE FEATURES OF THE SCHOOL BUS ROUTING PROBLEM by Hernan Andres Caceres Venegas February 1, 2017 A dissertation submitted to the Faculty of the Graduate School of the University
More informationSingle-part-type, multiple stage systems
MIT 2.853/2.854 Introduction to Manufacturing Systems Single-part-type, multiple stage systems Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Single-stage,
More informationPassenger-oriented railway disposition timetables in case of severe disruptions
Passenger-oriented railway disposition timetables in case of severe disruptions Stefan Binder Yousef Maknoon Michel Bierlaire STRC 2015, April 17th Outline Motivation Problem description Research question
More informationCIE4801 Transportation and spatial modelling Modal split
CIE4801 Transportation and spatial modelling Modal split Rob van Nes, Transport & Planning 31-08-18 Delft University of Technology Challenge the future Content Nested logit part 2 Modelling component 3:
More informationOptimal Adaptive Departure Time Choices with Real-Time Traveler Information Considering Arrival Reliability
University of Massachusetts Amherst ScholarWorks@UMass Amherst Masters Theses 1911 - February 2014 2009 Optimal Adaptive Departure Time Choices with Real-Time Traveler Information Considering Arrival Reliability
More informationComplexity of Routing Problems with Release Dates and Deadlines
Complexity of Routing Problems with Release Dates and Deadlines Alan Erera, Damian Reyes, and Martin Savelsbergh H. Milton Stewart School of Industrial and Systems Engineering Georgia Institute of Technology
More informationEEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture
More informationTraffic Modelling for Moving-Block Train Control System
Commun. Theor. Phys. (Beijing, China) 47 (2007) pp. 601 606 c International Academic Publishers Vol. 47, No. 4, April 15, 2007 Traffic Modelling for Moving-Block Train Control System TANG Tao and LI Ke-Ping
More informationProgressive Hedging-Based Meta- Heuristics for Stochastic Network Design
Progressive Hedging-Based Meta- Heuristics for Stochastic Network Design Teodor Gabriel Crainic Xiaorui Fu Michel Gendreau Walter Rei Stein W. Wallace January 2009 1. 2. 3. 4. 5. Progressive Hedging-Based
More informationTravel Time Calculation With GIS in Rail Station Location Optimization
Travel Time Calculation With GIS in Rail Station Location Optimization Topic Scope: Transit II: Bus and Rail Stop Information and Analysis Paper: # UC8 by Sutapa Samanta Doctoral Student Department of
More informationGreedy Algorithms. Kleinberg and Tardos, Chapter 4
Greedy Algorithms Kleinberg and Tardos, Chapter 4 1 Selecting breakpoints Road trip from Fort Collins to Durango on a given route. Fuel capacity = C. Goal: makes as few refueling stops as possible. Greedy
More informationRail Transportation Models for Rural Populations By Chase Rainwater, Ph.D., Ashlea Milburn, Ph.D. and Jeff Gwaltney. MBTC DOT 3024 October 2011
Rail Transportation Models for Rural Populations By Chase Rainwater, Ph.D., Ashlea Milburn, Ph.D. and Jeff Gwaltney MBTC DOT 3024 October 2011 Prepared for Mack-Blackwell Rural Transportation Center University
More informationCIV3703 Transport Engineering. Module 2 Transport Modelling
CIV3703 Transport Engineering Module Transport Modelling Objectives Upon successful completion of this module you should be able to: carry out trip generation calculations using linear regression and category
More informationThe Stochastic Vehicle Routing Problem
The Stochastic Vehicle Routing Problem Research Paper Vrije Universiteit Amsterdam Faculty of Sciences Study programme Business Analytics De Boelelaan 08a 08 HV Amsterdam Dimitry Erkin, email:dimitry.erkin@gmail.com
More informationURBAN TRANSPORTATION SYSTEM (ASSIGNMENT)
BRANCH : CIVIL ENGINEERING SEMESTER : 6th Assignment-1 CHAPTER-1 URBANIZATION 1. What is Urbanization? Explain by drawing Urbanization cycle. 2. What is urban agglomeration? 3. Explain Urban Class Groups.
More informationNetwork Equilibrium Models: Varied and Ambitious
Network Equilibrium Models: Varied and Ambitious Michael Florian Center for Research on Transportation University of Montreal INFORMS, November 2005 1 The applications of network equilibrium models are
More information1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)
1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours) Student Name: Alias: Instructions: 1. This exam is open-book 2. No cooperation is permitted 3. Please write down your name
More informationThe Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles
The Multiple Traveling Salesman Problem with Time Windows: Bounds for the Minimum Number of Vehicles Snežana Mitrović-Minić Ramesh Krishnamurti School of Computing Science, Simon Fraser University, Burnaby,
More informationRoute choice on transit networks with on-line information at stops
Route choice on transit networks with on-line information at stops Guido Gentile Dipartimento di Idraulica Trasporti e Strade Università degli Studi di Roma La Sapienza, guido.gentile@uniroma1.it Sang
More informationHW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]
HW7 Solutions. 5 pts.) James Bond James Bond, my favorite hero, has again jumped off a plane. The plane is traveling from from base A to base B, distance km apart. Now suppose the plane takes off from
More informationDeparture time choice equilibrium problem with partial implementation of congestion pricing
Departure time choice equilibrium problem with partial implementation of congestion pricing Tokyo Institute of Technology Postdoctoral researcher Katsuya Sakai 1 Contents 1. Introduction 2. Method/Tool
More informationResearch Article Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints
Discrete Dynamics in Nature and Society Volume 2012, Article ID 910754, 15 pages doi:10.1155/2012/910754 Research Article Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with
More informationWorkforce Scheduling. Outline DM87 SCHEDULING, TIMETABLING AND ROUTING. Outline. Workforce Scheduling. 1. Workforce Scheduling.
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 17 Workforce Scheduling 2. Crew Scheduling and Roering Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Workforce Scheduling
More informationINTRODUCTION TO TRANSPORTATION SYSTEMS
INTRODUCTION TO TRANSPORTATION SYSTEMS Lectures 5/6: Modeling/Equilibrium/Demand 1 OUTLINE 1. Conceptual view of TSA 2. Models: different roles and different types 3. Equilibrium 4. Demand Modeling References:
More informationis called an integer programming (IP) problem. model is called a mixed integer programming (MIP)
INTEGER PROGRAMMING Integer Programming g In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is
More informationIntegrating advanced discrete choice models in mixed integer linear optimization
Integrating advanced discrete choice models in mixed integer linear optimization Meritxell Pacheco Shadi Sharif Azadeh, Michel Bierlaire, Bernard Gendron Transport and Mobility Laboratory (TRANSP-OR) École
More informationRecoverable Robustness in Scheduling Problems
Master Thesis Computing Science Recoverable Robustness in Scheduling Problems Author: J.M.J. Stoef (3470997) J.M.J.Stoef@uu.nl Supervisors: dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl dr. ir. J.M. van den Akker
More informationChapter 4. Greedy Algorithms. Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved.
Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Copyright 2005 Pearson-Addison Wesley. All rights reserved. 1 4.1 Interval Scheduling Interval Scheduling Interval scheduling. Job j starts at s j and
More informationMetrolinx Transit Accessibility/Connectivity Toolkit
Metrolinx Transit Accessibility/Connectivity Toolkit Christopher Livett, MSc Transportation Planning Analyst Research and Planning Analytics Tweet about this presentation #TransitGIS OUTLINE 1. Who is
More informationOverall Plan of Simulation and Modeling I. Chapters
Overall Plan of Simulation and Modeling I Chapters Introduction to Simulation Discrete Simulation Analytical Modeling Modeling Paradigms Input Modeling Random Number Generation Output Analysis Continuous
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationOn Two Class-Constrained Versions of the Multiple Knapsack Problem
On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai Tami Tamir Department of Computer Science The Technion, Haifa 32000, Israel Abstract We study two variants of the classic
More informationThe Queue Inference Engine and the Psychology of Queueing. ESD.86 Spring 2007 Richard C. Larson
The Queue Inference Engine and the Psychology of Queueing ESD.86 Spring 2007 Richard C. Larson Part 1 The Queue Inference Engine QIE Queue Inference Engine (QIE) Boston area ATMs: reams of data Standard
More informationHow to estimate quantiles easily and reliably
How to estimate quantiles easily and reliably Keith Briggs, BT Technology, Services and Operations Fabian Ying, Mathematical Institute, University of Oxford Last modified 2017-01-13 10:55 1 Abstract We
More informationSession 3: Spatial Diagnosis of Mobility and Accessibility in Urban Mobility Systems
MESTRADO EM ENGENHARIA CIVIL MESTRADO EM URBANISMO E ORDENAMENTO DO TERRITÓRIO MESTRADO EM PLANEAMENTO E OPERAÇÃO DE TRANSPORTES Urban Mobility Management Main lecturer: Prof. Rosário Macário Assistent:
More informationProbe Placement Problem
Dimitri Papadimitriou (Alcatel-Lucent - Bell Labs) NMRG Meeting IETF 89 London (UK) Mar.2-7, 2014 Outline 1 Introduction 2 Model 3 Preliminary Results 4 Analysis and Conclusion imitri Papadimitriou (Alcatel-Lucent
More informationAnticipatory Freight Selection in Intermodal Long-haul Round-trips
Anticipatory Freight Selection in Intermodal Long-haul Round-trips A.E. Pérez Rivera and M.R.K. Mes Department of Industrial Engineering and Business Information Systems, University of Twente, P.O. Box
More informationAgent based modelling of technological diffusion and network influence
Agent based modelling of technological diffusion and network influence May 4, 23 Martino Tran, D.Phil.(Oxon) Senior Researcher, Environmental Change Institute, University of Oxford Outline Outline. Study
More informationExploring Human Mobility with Multi-Source Data at Extremely Large Metropolitan Scales. ACM MobiCom 2014, Maui, HI
Exploring Human Mobility with Multi-Source Data at Extremely Large Metropolitan Scales Desheng Zhang & Tian He University of Minnesota, USA Jun Huang, Ye Li, Fan Zhang, Chengzhong Xu Shenzhen Institute
More informationUnderstanding Travel Time to Airports in New York City Sierra Gentry Dominik Schunack
Understanding Travel Time to Airports in New York City Sierra Gentry Dominik Schunack 1 Introduction Even with the rising competition of rideshare services, many in New York City still utilize taxis for
More informationThe Location Selection Problem for the Household Activity Pattern Problem UCI-ITS-WP Jee Eun Kang Will W. Recker
UCI-ITS-WP-12-1 The Location Selection Problem for the Household Activity Pattern Problem UCI-ITS-WP-12-1 Jee Eun Kang Will W. Recker Department of Civil Engineering and Institute of Transportation Studies
More informationState-dependent and Energy-aware Control of Server Farm
State-dependent and Energy-aware Control of Server Farm Esa Hyytiä, Rhonda Righter and Samuli Aalto Aalto University, Finland UC Berkeley, USA First European Conference on Queueing Theory ECQT 2014 First
More informationThe World Bank China Wuhan Second Urban Transport (P112838)
EAST ASIA AND PACIFIC China Transport Global Practice IBRD/IDA Specific Investment Loan FY 2010 Seq No: 7 ARCHIVED on 28-Jun-2015 ISR18605 Implementing Agencies: Wuhan Urban Construction Utilization of
More informationMOR CO Analysis of future residential and mobility costs for private households in Munich Region
MOR CO Analysis of future residential and mobility costs for private households in Munich Region The amount of the household budget spent on mobility is rising dramatically. While residential costs can
More informationAn improved method for solving micro-ferry scheduling problems
Delft University of Technology Delft Center for Systems and Control Technical report 12-028 An improved method for solving micro-ferry scheduling problems M. Burger, B. De Schutter, and H. Hellendoorn
More informationDiscrete-event simulations
Discrete-event simulations Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Why do we need simulations? Step-by-step simulations; Classifications;
More informationring structure Abstract Optical Grid networks allow many computing sites to share their resources by connecting
Markovian approximations for a grid computing network with a ring structure J. F. Pérez and B. Van Houdt Performance Analysis of Telecommunication Systems Research Group, Department of Mathematics and
More informationEnergy-Efficient Broadcast Scheduling. Speed-Controlled Transmission Channels
for Speed-Controlled Transmission Channels Joint work with Christian Gunia from Freiburg University in ISAAC 06. 25.10.07 Outline Problem Definition and Motivation 1 Problem Definition and Motivation 2
More informationKnapsack and Scheduling Problems. The Greedy Method
The Greedy Method: Knapsack and Scheduling Problems The Greedy Method 1 Outline and Reading Task Scheduling Fractional Knapsack Problem The Greedy Method 2 Elements of Greedy Strategy An greedy algorithm
More informationENABLING CONGESTION AVOIDANCE REDUCTION IN THE MICHIGAN-OHIO TRANSPORTATION NETWORK TO IMPROVE SUPPLY CHAIN EFFICIENCY: FREIGHT ATIS
MICHIGAN OHIO UNIVERSITY TRANSPORTATION CENTER Alternate energy and system mobility to stimulate economic development. Report No: MIOH UTC SC2p5 2010-Final ENABLING CONGESTION AVOIDANCE AND REDUCTION IN
More informationSimulation of Congestion Phenomena on Transit Networks
SAPIENZA UNIVERSITY OF ROME MASTER THESIS Simulation of Congestion Phenomena on Transit Networks Author: Lory Michelle BRESCIANI MIRISTICE 1699496 Supervisor: Chiar.mo Professore Guido GENTILE Academic
More informationMEZZO: OPEN SOURCE MESOSCOPIC. Centre for Traffic Research Royal Institute of Technology, Stockholm, Sweden
MEZZO: OPEN SOURCE MESOSCOPIC SIMULATION Centre for Traffic Research Royal Institute of Technology, Stockholm, Sweden http://www.ctr.kth.se/mezzo 1 Introduction Mesoscopic models fill the gap between static
More informationA Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty
A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty Hatice Calik 1,2 and Bernard Fortz 1,3 1 Department of Computer Science, Université
More informationMachine Scheduling with Deliveries to Multiple Customer Locations
This is the Pre-Published Version. Machine Scheduling with Deliveries to Multiple Customer Locations Chung-Lun Li George Vairaktarakis Chung-Yee Lee April 2003 Revised: November 2003 Abstract One important
More informationJOINT PRICING AND NETWORK CAPACITY SETTING PROBLEM
Advanced OR and AI Methods in Transportation JOINT PRICING AND NETWORK CAPACITY SETTING PROBLEM Luce BROTCORNE, Patrice MARCOTTE, Gilles SAVARD, Mickael WIART Abstract. We consider the problem of jointly
More information