Dynamic Vehicle Routing in MATSim
|
|
- Cecil Willis
- 8 years ago
- Views:
Transcription
1 Poznan University of Technology Department of Motor Vehicles and Road Transport ZPSiTD Dynamic Vehicle Routing in MATSim Simulation and Optimization Michal Maciejewski
2 Agenda Dynamic Vehicle Routing Problem Static VRP Dynamic VRP DVRP Optimizer Models Algorithms MATSim + DVRP Optmizer Recent results Future plans 2
3 CVRP CVRP = Capacitated Vehicle Routing Problem Input data 1 depot (node 0) n customers (nodes 1 n) k vehicles c ij travel cost for link i j d i demand of node i C vehicle capacity Goal: minimal-cost routes 2 d 1 5 d 5 d d 4 d d 2 6 d d 9 3 d 3 Constraints: each route starts and ends at the depot each customer visited exactly once capacity of vehicles is never exceeded 3
4 CVRP CVRP = Capacitated Vehicle Routing Problem Input data 1 depot (node 0) n customers (nodes 1 n) k vehicles c ij travel cost for link i j d i demand of node i C vehicle capacity 2 d 1 5 d 5 d 8 1 c 50 c 01 c 08 8 d 4 d 7 4 c 12 7 c 74 c 40 d 2 c 25 0 c 06 c 90 c 39 c 67 6 d 6 9 d 9 3 d 3 c 83 Goal: minimal-cost routes Constraints: each route starts and ends at the depot each customer visited exactly once capacity of vehicles is never exceeded R 1 = {1, 2, 5} R 2 = {8, 3, 9} R 3 = {6, 7, 4} d 1 + d 2 + d 5 C d 8 + d 3 + d 9 C d 6 + d 7 + d 4 C total cost = c 01 + c 12 + c 25 + c c 08 + c 83 + c 39 + c c 06 + c 67 + c 74 + c 40 4
5 VRP types Most popular types (Toth, Vigo) DCVRP = Distance-Constrained VRP VRPB = VRP with Backhauls VRPTW = VRP with Time Windows VRPPD = VRP with Pickup and Delivery VRPBTW = VRP with Backhauls and TW VRPPDTW = VRP with P&D and TW 5
6 Dynamic VRP DVRP properties (Larsen et al., 2007) Not all information relevant to the planning of the routes is known by the planner before the routing process begins Information can change after the initial routes have been constructed Types of requests advance requests (static; known in advance) immediate requests (dynamic; dynamically appearing) 6
7 Dynamic VRP DVRP properties (Larsen et al., 2007) Not all information relevant to the planning of the routes is known by the planner before the routing process begins Information can change after the initial routes have been constructed Types of requests advance requests (static; known in advance) immediate requests (dynamic; dynamically appearing) diversion from the current destination 7
8 Framework for DVRP General scheme INITIAL DATA OPTIMIZER events routes CONCURRENT ON-LINE PROCESSES CUSTOMER SERVICE TRAFFIC MONITORING FLEET MANAGEMENT 9
9 Classification of DVRP Degree of dynamism vs. objective (Larsen et al., 2007) 10
10 Why DVRP + MATSim? Planning Demand Responsive Transport services service topology and principles demand modelling (market prediction) pricing algorithms costs inter-modal dependencies and sustainability Other services, e.g. taxi courier (demand from external data) Benchmarking DVRP algorithms on more realistic test cases real network + travel times demand (for transport services) 11
11 Agenda Dynamic Vehicle Routing Problem Static VRP Dynamic VRP DVRP Optimizer Models Algorithms MATSim + DVRP Optimizer Recent results Future plans 12
12 Current status for DVRP Optimizer MDDVRPTW = Multi-Depot Dynamic VRP with Time Windows and Dynamic Travel Times/Costs m depots n customers k vehicles c ij (t d ) dynamic travel cost for link i j t ij (t d ) dynamic travel time for link i j d i demand of node i i C k vehicle capacity [E k, L k ] time window of vehicle k [a i, b i ] time window of request i Missing: pickup & delivery (for shared many-to-many services) soft time windows 13
13 Current status for DVRP Optimizer Supported problems (fully/partially) 14
14 Request - state diagram 16
15 Route - state diagram 17
16 VRP process Route - plan Route - status Request 1 - status Request 2 - status Request 3 - status 20
17 Waiting strategies immediate request Waiting strategies earliest departure/arrival latest departure/arrival 21
18 Routes 24
19 Routes 25
20 Routes 26
21 Routes 27
22 Routes (final results) 28
23 Agenda Dynamic Vehicle Routing Problem Static VRP Dynamic VRP DVRP Optimizer Models Algorithms MATSim + DVRP Optimizer Recent results Future plans 30
24 Architecture Data flows Allows for offline optimization 1. Run MATSim simulation scenario 2. Process traffic data 3. Run VRP Optimizer with external request data 31
25 Road network to graph mapping Input: road network locations (depots, customers ) Output dynamic graph G=<V,A> least-cost arcs travel distances/costs travel times sequence of visited nodes/links (Path in MATSim) 100 customers + 1 depot 10,100 arcs 1000 customers + 10 depots 1,019,090 arcs 32
26 Arc (shortest path) estimation Data source LeastCostPathCalculator TravelTimeCalculator... TravelTimeData TravelTimeData contains travel times for a single link for each time slice within the simulation Default precision is 15 min (the length of a time slice) Calculation (trivial) for each arc find the shortest path for each (15-min) time slice, i.e. (travel time, travel distance, sequence of nodes/links) 100 customers + 1 depot, 24-hour simulation, 15-minute time slices 10,100 arcs * 96 s-path/arc = 969,600 shortest paths 1000 customers + 10 depots,... 97,832,640 shortest paths Calculation (more sophisticated) for each arc find the shortest path for each SENSIBLE time slice SENSIBLE because considering constraints (mostly time-related) of vehicles, depots, customers and requests 33
27 Waiting strategies Earliest Departure/Arrival A vehicle departures at 9:00 (earliest possible departure time) TT_D(t): gettraveltimeondeparture(int departuretime) (if (mod(t, binsize)!= 0) linear interpolation) The vehicle will arrive at a destination at 9:00 + TT_D(9:00) Latest Departure/Arrival A vehicle must arrive at the next stop by 10:00 (latest possible arrival time) TT_A(t): gettraveltimeonarrival(int arrivaltime) (if (mod(t, binsize)!= 0) linear interpolation) The vehicle must start out at 10:00 - TT_A(10:00) Instead of Backward Dijkstra-like algorithms a calculation of TT_A(t) based on TT_D(t) TT_A(t+TT_D(t)) = TT_D(t) TT_A are not calculated with a constant time gaps have to be normalized 34
28 Network 36
29 Route 1 37
30 Route 1 38
31 Route 1 39
32 Route 1 40
33 Architecture Data flows Bi-directional mappings Person (Vehicle/Agent?) Vehicle Plan Schedule (Route) Activity/Leg Request/Trip... 41
34 Online optimization Full integration of MATSim and VRP Optimizer INITIAL DATA OPTIMIZER events routes CONCURRENT ON-LINE PROCESSES CUSTOMER SERVICE TRAFFIC MONITORING FLEET MANAGEMENT 42
35 Thank you 43
Towards Multi-Agent Simulation of the Dynamic Vehicle Routing Problem in MATSim
Towards Multi-Agent Simulation of the Dynamic Vehicle Routing Problem in MATSim Micha l Maciejewski 1 and Kai Nagel 2 1 Institute of Machines and Motor Vehicles, Faculty of Machines and Transportation,
More informationResearch 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 informationBranch-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 informationVEHICLE 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 informationOptimization 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 informationP13 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 informationA cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
European Journal of Operational Research 176 (2007) 1478 1507 Discrete Optimization A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
More informationSimulation and dynamic optimization of taxi services in MATSim
TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000 000 issn 0041-1655 eissn 1526-5447 00 0000 0001 INFORMS doi 10.1287/xxxx.0000.0000 c 0000 INFORMS Authors are encouraged to submit new papers
More informationThe 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 informationCharles 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 informationPlanning and optimisation of vehicle routes for fuel oil distribution
Planning and optimisation of vehicle routes for fuel oil distribution Andrea E. Rizzoli a,c, Norman Casagrande a, Alberto V. Donati a, Luca Maria Gambardella a,c, Daniele Lepori b, Roberto Montemanni a,
More informationModeling and Solving the Capacitated Vehicle Routing Problem on Trees
in The Vehicle Routing Problem: Latest Advances and New Challenges Modeling and Solving the Capacitated Vehicle Routing Problem on Trees Bala Chandran 1 and S. Raghavan 2 1 Department of Industrial Engineering
More informationStrategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand
Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand Arunya Boonkleaw, Nanthi Sutharnnarunai, PhD., Rawinkhan Srinon, PhD.
More informationStochastic Ship Fleet Routing with Inventory Limits YU YU
Stochastic Ship Fleet Routing with Inventory Limits YU YU Doctor of Philosophy University of Edinburgh 2009 Declaration I declare that this thesis was composed by myself and that the work contained therein
More informationOPTIMIZED H O M E C A R E S C H E D U L I N G AND ROUTING
OPTIMIZED H O M E C A R E S C H E D U L I N G AND ROUTING A White Paper for Home Care Executives and Operations Managers ALGORITHM-BASED OPTIMIZATION FOR SOLVING THE SCHEDULING AND ROUTING PROBLEMS IN
More informationSolving 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 informationIRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks
IRMA: Integrated Routing and MAC Scheduling in Multihop Wireless Mesh Networks Zhibin Wu, Sachin Ganu and Dipankar Raychaudhuri WINLAB, Rutgers University 2006-11-16 IAB Research Review, Fall 2006 1 Contents
More informationOptimizing departure times in vehicle routes
Optimizing departure times in vehicle routes A.L. Kok, E.W. Hans, J.M.J. Schutten Operational Methods for Production and Logistics, University of Twente, P.O. Box 217, 7500AE, Enschede, Netherlands Abstract
More informationFLEET 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 informationOptimization-based decision support within healthcare and transportation
Optimization-based decision support within healthcare and transportation evita Scientific Meeting Geilo, Norway January 28, 2010 Geir Hasle, SINTEF 1 Acknowledgment Henrik Andersson, NTNU Marielle Christiansen,
More informationVehicle Routing: Transforming the Problem. Richard Eglese Lancaster University Management School Lancaster, U.K.
Vehicle Routing: Transforming the Problem Richard Eglese Lancaster University Management School Lancaster, U.K. Transforming the Problem 1. Modelling the problem 2. Formulating the problem 3. Changing
More informationVEHICLE 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 informationContext-Aware Route Planning
Context-Aware Route Planning A. W. ter Mors, C. Witteveen, J. Zutt, F. A. Kuipers Delft University of Technology September 28, 2010 Problem description A set of agents, each with their own start and destination
More informationHeuristic and exact algorithms for vehicle routing problems. Stefan Ropke
Heuristic and exact algorithms for vehicle routing problems Stefan Ropke December 2005 Preface This Ph.D. thesis has been prepared at the Department of Computer Science at the University of Copenhagen
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 I: Basic Models and Algorithms Introduction Freight routing
More informationOn 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 informationEngineering Route Planning Algorithms. Online Topological Ordering for Dense DAGs
Algorithm Engineering for Large Graphs Engineering Route Planning Algorithms Peter Sanders Dominik Schultes Universität Karlsruhe (TH) Online Topological Ordering for Dense DAGs Deepak Ajwani Tobias Friedrich
More informationChapter 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 informationFactors to Describe Job Shop Scheduling Problem
Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus
More informationVILNIUS UNIVERSITY. Gintaras Vaira GENETIC ALGORITHM FOR VEHICLE ROUTING PROBLEM
VILNIUS UNIVERSITY Gintaras Vaira GENETIC ALGORITHM FOR VEHICLE ROUTING PROBLEM Doctoral Dissertation Technological Sciences, Informatics Engineering (07 T) Vilnius, 2014 The dissertation has been prepared
More informationAnt Colony Optimization for vehicle routing in advanced logistics systems
Ant Colony Optimization for vehicle routing in advanced logistics systems Luca Maria Gambardella a,b, Andrea E. Rizzoli a,b, Fabrizio Oliverio b, Norman Casagrande a, Alberto V. Donati a, Roberto Montemanni
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
137 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS 8.1 CONCLUSION In this thesis, efficient schemes have been designed and analyzed to control congestion and distribute the load in the routing process of
More informationLecture 2.1 : The Distributed Bellman-Ford Algorithm. Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol
Lecture 2 : The DSDV Protocol Lecture 2.1 : The Distributed Bellman-Ford Algorithm Lecture 2.2 : The Destination Sequenced Distance Vector (DSDV) protocol The Routing Problem S S D D The routing problem
More informationTowards 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 informationAutomated SEO. A Market Brew White Paper
Automated SEO A Market Brew White Paper Abstract In this paper, we use the term Reach to suggest the forecasted traffic to a particular webpage or website. Reach is a traffic metric that describes an expected
More informationSolving Real-World Vehicle Routing Problems with Evolutionary Algorithms
Solving Real-World Vehicle Routing Problems with Evolutionary Algorithms Thomas Weise and Alexander Podlich and Christian Gorldt Preview This document is a preview version and not necessarily identical
More informationConstraint Programming for the Vehicle Routing Problem. Philip Kilby
Constraint Programming for the Vehicle Routing Problem Philip Kilby A bit about NICTA National Information and Communications Technology Australia (NICTA) Research in ICT since 24 Major Labs in Sydney,
More informationWaste 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 informationDynamic programming formulation
1.24 Lecture 14 Dynamic programming: Job scheduling Dynamic programming formulation To formulate a problem as a dynamic program: Sort by a criterion that will allow infeasible combinations to be eli minated
More informationIs Truck Queuing Productive? Study of truck & shovel operations productivity using simulation platform MineDES
Is Truck Queuing Productive? Study of truck & shovel operations productivity using simulation platform MineDES Dmitry Kostyuk Specialist Scientist, Group Resource and Business Optimisation 25 November
More information1 st year / 2014-2015/ Principles of Industrial Eng. Chapter -3 -/ Dr. May G. Kassir. Chapter Three
Chapter Three Scheduling, Sequencing and Dispatching 3-1- SCHEDULING Scheduling can be defined as prescribing of when and where each operation necessary to manufacture the product is to be performed. It
More informationNetwork Load Balancing Using Ant Colony Optimization
Network Load Balancing Using Ant Colony Optimization Mr. Ujwal Namdeo Abhonkar 1, Mr. Swapnil Mohan Phalak 2, Mrs. Pooja Ujwal Abhonkar 3 1,3 Lecturer in Computer Engineering Department 2 Lecturer in Information
More informationTowards Load Balancing in SDN Networks During DDoS attacks
Towards Load Balancing in SDN Networks During DDoS attacks Mikhail Belyaev St.Petersburg Polytechnic University Svetlana Gaivoronski Moscow State University ARCCN DDoS - attacks DDoS attack distributed
More informationOn the effect of forwarding table size on SDN network utilization
IBM Haifa Research Lab On the effect of forwarding table size on SDN network utilization Rami Cohen IBM Haifa Research Lab Liane Lewin Eytan Yahoo Research, Haifa Seffi Naor CS Technion, Israel Danny Raz
More informationAn Instructional Aid System for Driving Schools Based on Visual Simulation
An Instructional Aid System for Driving Schools Based on Visual Simulation Salvador Bayarri, Rafael Garcia, Pedro Valero, Ignacio Pareja, Institute of Traffic and Road Safety (INTRAS), Marcos Fernandez
More informationOPTIMAL VEHICLE TIMETABLING, ROUTING AND DRIVER DUTY SCHEDULING CASE STUDY: BUS DEPOT PROBLEM
OPTIMAL VEHICLE TIMETABLING, ROUTING AND DRIVER DUTY SCHEDULING CASE STUDY: BUS DEPOT PROBLEM Mr Tushar T. Rasal Department of Electronics & Telecommunication Engineering Rajarambapu Institute of Technology
More informationAlgorithms for Assigning Substrate Network Resources to Virtual Network Components
Algorithms for Assigning Substrate Network Resources to Virtual Network Components Yong Zhu and Mostafa Ammar Networking and Telecommunications Group Georgia Institute of Technology, Atlanta, Georgia Email:
More informationAn Efficient Algorithm for Solving a Stochastic Location-Routing Problem
Journal of mathematics and computer Science 12 (214) 27 38 An Efficient Algorithm for Solving a Stochastic LocationRouting Problem H.A. HassanPour a, M. MosadeghKhah a, M. Zareei 1 a Department of Industrial
More informationVEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul.
1 VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK By Kuladej Panapinun and Peerayuth Charnsethikul Abstract Vehicle routing problem (VRP) and its extension
More informationJOpt TourPlanner. product overview
JOpt TourPlanner product overview 2010 ... at a glance JOpt TourPlanner is a multiple vehicle routing component for software developers is available for different programming models (.NET, JAVA, SOAP)
More informationINTERACTIVE TRAINING SOFTWARE FOR OPTIMUM TRAVEL ROUTE ANALYSIS APPLICATIONS IN RAILWAY NETWORKS
1. Uluslar arası Raylı Sistemler Mühendisliği Çalıştayı (IWRSE 12), 11-13 Ekim 2012, Karabük, Türkiye INTERACTIVE TRAINING SOFTWARE FOR OPTIMUM TRAVEL ROUTE ANALYSIS APPLICATIONS IN RAILWAY NETWORKS Abstract
More informationA Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions
A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität
More informationWeb GIS for hjemmetjenesten
Web GIS for hjemmetjenesten Ragnhild Angelsen Ragnhild Angelsen: Web GIS for Home Care Services KART OG PLAN, Vol. 73, pp. 165 178, POB 5003, NO-1432 Ås, ISSN 0047-3278 This article reports the results
More informationAppendix A. About RailSys 3.0. A.1 Introduction
Appendix A About RailSys 3.0 This appendix describes the software system for analysis RailSys used to carry out the different computational experiments and scenario designing required for the research
More information2.3.4 Project planning
.. Project planning project consists of a set of m activities with their duration: activity i has duration d i, i =,..., m. estimate Some pairs of activities are subject to a precedence constraint: i j
More informationQoS optimization for an. on-demand transportation system via a fractional linear objective function
QoS optimization for an Load charge ratio on-demand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization
More informationLOGICAL TOPOLOGY DESIGN Practical tools to configure networks
LOGICAL TOPOLOGY DESIGN Practical tools to configure networks Guido. A. Gavilanes February, 2010 1 Introduction to LTD " Design a topology for specific requirements " A service provider must optimize its
More informationPath Selection Methods for Localized Quality of Service Routing
Path Selection Methods for Localized Quality of Service Routing Xin Yuan and Arif Saifee Department of Computer Science, Florida State University, Tallahassee, FL Abstract Localized Quality of Service
More informationUn 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 informationInvestigating accessibility indicators for feedback from MATSim to UrbanSim
Thomas W. Nicolai Transport Systems Planning and Transport Telematics, Berlin Institute of Technology (TU Berlin) 1 Investigating accessibility indicators for feedback from MATSim to UrbanSim Annual User
More informationDynamic Routing Protocols II OSPF. Distance Vector vs. Link State Routing
Dynamic Routing Protocols II OSPF Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. 1 Distance Vector vs. Link State Routing With distance
More informationGoals of the Unit. spm - 2014 adolfo villafiorita - introduction to software project management
Project Scheduling Goals of the Unit Making the WBS into a schedule Understanding dependencies between activities Learning the Critical Path technique Learning how to level resources!2 Initiate Plan Execute
More informationChapter 15: Dynamic Programming
Chapter 15: Dynamic Programming Dynamic programming is a general approach to making a sequence of interrelated decisions in an optimum way. While we can describe the general characteristics, the details
More informationLIST OF FIGURES. Figure No. Caption Page No.
LIST OF FIGURES Figure No. Caption Page No. Figure 1.1 A Cellular Network.. 2 Figure 1.2 A Mobile Ad hoc Network... 2 Figure 1.3 Classifications of Threats. 10 Figure 1.4 Classification of Different QoS
More informationA WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES
Advanced OR and AI Methods in Transportation A WEB-BASED TRAFFIC INFORMATION SYSTEM USING WIRELESS COMMUNICATION TECHNIQUES Akmal ABDELFATAH 1, Abdul-Rahman AL-ALI 2 Abstract. This paper presents a procedure
More informationLearning Objectives. Required Resources. Tasks. Deliverables
Fleet Modeling 10 Purpose This activity introduces you to the Vehicle Routing Problem (VRP) and fleet modeling through the use of a previously developed model. Using the model, you will explore the relationships
More informationScalable Source Routing
Scalable Source Routing January 2010 Thomas Fuhrmann Department of Informatics, Self-Organizing Systems Group, Technical University Munich, Germany Routing in Networks You re there. I m here. Scalable
More informationPUBLIC TRANSPORT ON DEMAND
MASTER S THESIS SUMMARY PUBLIC TRANSPORT ON DEMAND A better match between passenger demand and capacity M.H. Matena C o n n e x x i o n L a a p e r s v e l d 7 5 1213 BV Hilversum PUBLIC TRANSPORT ON
More informationThe Rolling Stock Recovery Problem. Literature review. Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ
The Rolling Stock Recovery Problem Julie Jespersen Groth *α, Jesper Larsen β and Jens Clausen *γ DTU Management Engineering, The Technical University of Denmark, Produktionstorvet, DTU Building 424, 2800
More informationSolving 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 informationOptimization of recyclable waste collection using real-time information.
6th International Conference on Industrial Engineering and Industrial Management. XVI Congreso de Ingeniería de Organización. Vigo, July 18-20, 2012 Optimization of recyclable waste collection using real-time
More informationSynergistic Sensor Location for Cost-Effective Traffic Monitoring
Synergistic Sensor Location for Cost-Effective Traffic Monitoring ManWo Ng, Ph.D. Assistant Professor Department of Modeling, Simulation and Visualization Engineering & Department of Civil and Environmental
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationTransportation. 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 informationLECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES
LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES Learning objective To explain various work shift scheduling methods for service sector. 8.9 Workforce Management Workforce management deals in
More informationChristian Bettstetter. Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks
Christian Bettstetter Mobility Modeling, Connectivity, and Adaptive Clustering in Ad Hoc Networks Contents 1 Introduction 1 2 Ad Hoc Networking: Principles, Applications, and Research Issues 5 2.1 Fundamental
More informationCost 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 informationAn XML Object Model for Rich Vehicle Routing Problems
An XML Object Model for Rich Vehicle Routing Problems Kevin Sim*, Emma Hart, Neil Urquhart Centre for Algorithms, Visualisation and Evolving Systems Edinburgh Napier University, Merchiston Campus, Edinburgh,
More informationCoordination in vehicle routing
Coordination in vehicle routing Catherine Rivers Mathematics Massey University New Zealand 00.@compuserve.com Abstract A coordination point is a place that exists in space and time for the transfer of
More informationProject and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi
Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture - 9 Basic Scheduling with A-O-A Networks Today we are going to be talking
More informationContinuous 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 informationMartin 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 informationImplementation of traffic effect estimations. for intermodal dynamic routing services on VIELMOBIL - an. ITS-platform for the RheinMain region
Implementation of traffic effect estimations for intermodal dynamic routing services on VIELMOBIL - an ITS-platform for the RheinMain region Rüdiger BERNHARD, Enrico STEIGER, Stefan KRAMPE, Stefan KOLLARITS,
More informationA SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS
A SIMULATION MODEL FOR RESOURCE CONSTRAINED SCHEDULING OF MULTIPLE PROJECTS B. Kanagasabapathi 1 and K. Ananthanarayanan 2 Building Technology and Construction Management Division, Department of Civil
More informationTransmodel in UML. SITP 2 Système d'information Transport Public
Transmodel in UML Equipe de projet Page 0 Version 0. 04/09/2003 Contents. Introduction... 2. Class diagrams... 3 2.. Network description... 3 2... CD TM Fig. 0 Points and Links... 3 2..2. CD TM Fig. 02
More informationAutomated Scheduling Methods. Advanced Planning and Scheduling Techniques
Advanced Planning and Scheduling Techniques Table of Contents Introduction 3 The Basic Theories 3 Constrained and Unconstrained Planning 4 Forward, Backward, and other methods 5 Rules for Sequencing Tasks
More informationIn-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 informationMetaheuristics in Vehicle Routing
Metaheuristics in Vehicle Routing Michel Gendreau CIRRELT and MAGI École Polytechnique de Montréal Vilamoura, Portugal, 4-6 February 2012 Presentation outline 1) Vehicle Routing Problems 2) Metaheuristics
More informationLoad 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 informationDealing with Uncertainty in Operational Transport Planning
Dealing with Uncertainty in Operational Transport Planning Jonne Zutt, Arjan van Gemund, Mathijs de Weerdt, and Cees Witteveen Abstract An important problem in transportation is how to ensure efficient
More informationJoint Optimization of Routing and Radio Configuration in Fixed Wireless Networks
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks David Coudert, Napoleão Nepomuceno, Hervé Rivano Projet Mascotte, I3S(CNRS-UNSA) INRIA Réunion Mascotte, March 2009 MASCOTTE
More informationA New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks
A New Fault Tolerant Routing Algorithm For GMPLS/MPLS Networks Mohammad HossienYaghmae Computer Department, Faculty of Engineering, Ferdowsi University of Mashhad, Mashhad, Iran hyaghmae@ferdowsi.um.ac.ir
More informationA Tool For Active FLEET Management and Analysis of Activities of a Snow PlowING and a Road Salting Fleet
A Tool For Active FLEET Management and Analysis Activities a Snow PlowING and a Road Salting Fleet Rok Strašek, Tina Vukasović Abstract - Current economic crisis combined with increasing fuel costs rises
More informationService Network Design for Consolidation Freight Carriers
Service Network Design for Consolidation Freight Carriers Teodor Gabriel Crainic ESG UQAM & CIRRELT - CRT CIRRELT Consolidation Freight Transportation Long distance freight transportation Railways Less-Than-Truckload
More informationAgent-based simulation of electric taxicab fleets
Agent-based simulation of electric taxicab fleets Joschka Bischoff, M.Sc. bischoff@vsp.tu-berlin.de Dr. Michal Maciejewski maciejewski@vsp.tu-berlin.de Motivation Current Battery electric vehicles (BEV)
More informationTruckload Carrier Selection, Routing and Cost Optimization
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Masters Theses Graduate School 12-2015 Truckload Carrier Selection, Routing and Cost Optimization Zhixin Han University
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
More informationTransportation cost estimation in freight distribution services with time windows: application to an Italian urban area
Transportation cost estimation in freight distribution services with time windows: application to an Italian urban area Francesco P. Deflorio, Jesus Gonzalez-Feliu, Guido Perboli, Roberto Tadei To cite
More informationA flexible metaheuristic framework for solving rich vehicle routing problems
A flexible metaheuristic framework for solving rich vehicle routing problems Inauguraldissertation zur Erlangung des Doktorgrades der Wirtschafts- und Sozialwissenschaftlichen Fakultät der Universität
More informationUsing Ant Colony Optimization for Infrastructure Maintenance Scheduling
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning
More information