I-DMSS for Bus Rental in Seoul, Korea Katta G. Murty Dept. IOE, U. of Michigan Ann Arbor, MI-48109-2117, USA and Woo-Je Kim Dept.

Slides:



Advertisements
Similar presentations
Introduction to Algorithms
Advertisements

1 Chapter 14 Making the most of things: Linear Programming.
Operations Scheduling
Facility Location Decisions
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
Adaptive Large Neighbourhood Search for the Vehicle Routing Problem with Drivers Working Hours Asvin Goel MIT-Zaragoza International Logistics Program.
COMP 482: Design and Analysis of Algorithms
§1 Greedy Algorithms ALGORITHM DESIGN TECHNIQUES
Operating Systems Disk Scheduling A. Frank - P. Weisberg.
and 6.855J Modified Label Correcting Algorithm.
Capacity Planning. How much long-range capacity is needed When more capacity is needed Where facilities should be located (location) How facilities should.
Traffic assignment.
1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri.
COMP 482: Design and Analysis of Algorithms
1 Chapter 4 Greedy Algorithms Slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved.
Great Theoretical Ideas in Computer Science
Load Balancing Parallel Applications on Heterogeneous Platforms.
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
Bart Jansen 1.  Problem definition  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least k leaves?
Shortest Paths (1/11)  In this section, we shall study the path problems such like  Is there a path from city A to city B?  If there is more than one.
Optimization of Sequential Networks Step in Synthesis: Problem Flow Table Reduce States Minimum-State Table State Assignment Circuit Transition Table Flip-Flop.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
Chapter 3 Workforce scheduling.
Transportation Problem (TP) and Assignment Problem (AP)
Greedy Algorithms Greed is good. (Some of the time)
Contents College 4 §4.1, §4.2, §4.4, §4.6 Extra literature on resource constrained project scheduling (will be handed out)
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Crew Scheduling Housos Efthymios, Professor Computer Systems Laboratory (CSL) Electrical & Computer Engineering University of Patras.
Vehicle Routing & Scheduling: Part 1
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Arc-based formulations for coordinated drayage problems Christopher Neuman Karen Smilowitz Athanasios Ziliaskopoulos INFORMS San Jose November 18, 2002.
The Min-Max Split Delivery Multi- Depot Vehicle Routing Problem with Minimum Delivery Amounts X. Wang, B. Golden, and E. Wasil INFORMS San Francisco November.
Math443/543 Mathematical Modeling and Optimization
Vehicle Routing & Scheduling
03/07/2007CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Network Optimization Problems: Models and Algorithms
03/03/2004CSCI 315 Operating Systems Design1 Deadlock Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating.
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Elements of the Heuristic Approach
Algorithms for Network Optimization Problems This handout: Minimum Spanning Tree Problem Approximation Algorithms Traveling Salesman Problem.
1.3 Modeling with exponentially many constr.  Some strong formulations (or even formulation itself) may involve exponentially many constraints (cutting.
1 Network Optimization Chapter 3 Shortest Path Problems.
Hungarian Algorithm Vida Movahedi Elderlab, York University June 2007.
1 Let us consider that local authorities want to locate fire brigades at some places from the set 1, 2, 3 and 4 so that a distance from the worst located.
Chapter 7 Transportation, Assignment & Transshipment Problems
Bus-Driven Floorplanning Hua Xiang*, Xiaoping Tang +, Martin D. F. Wong* * Univ. Of Illinois at Urbana-Champaign + Cadence Design Systems Inc.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Operational Research & ManagementOperations Scheduling Workforce Scheduling 1.Days-Off Scheduling 2.Shift Scheduling 3. Cyclic Staffing Problem (& extensions)
Workforce scheduling – Days off scheduling 1. n is the max weekend demand n = max(n 1,n 7 ) Surplus number of employees in day j is u j = W – n j for.
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
1 Deadlock Definition of deadlock Condition for its occurrence Solutions for avoiding and breaking deadlock –Deadlock Prevention –Deadlock Avoidance –Deadlock.
© J. Christopher Beck Lecture 17: Introduction to Timetabling.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Dr. Kalpakis CMSC 421, Operating Systems Deadlocks.
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
Example Apply hierarchical clustering with d min to below data where c=3. Nearest neighbor clustering d min d max will form elongated clusters!
Recursion ITI 1121 N. El Kadri. Reminders about recursion In your 1 st CS course (or its equivalent), you have seen how to use recursion to solve numerical.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
BASIC FACILITY LOCATION PROBLEMS Facility location problems deal with the question of where to place facilities & how to assign customers Location analysis.
Tabu Search Applications Outlines: 1.Application of Tabu Search 2.Our Project with Tabu Search: EACIIT analytics.
Timetable Problem solving using Graph Coloring
The Taxi Scheduling Problem
1.3 Modeling with exponentially many constr.
Routing and Logistics Arc Routing 2018/11/19.
TransCAD Vehicle Routing 2018/11/29.
1.3 Modeling with exponentially many constr.
CIM Slide no: 1 Reasons for Automating 1.Increase labor productivity 2.Reduce labor cost 3.Mitigate the effects of labor shortages 4.Reduce or remove routine.
Presentation transcript:

i-DMSS for Bus Rental in Seoul, Korea Katta G. Murty Dept. IOE, U. of Michigan Ann Arbor, MI , USA and Woo-Je Kim Dept. of IISE, Seoul National University of Technology 172 Gongneung 2-dong, Nowon-gu, Seoul , South Korea

Work done for Arirang in Seoul, South Korea, which rents buses (with drivers) to groups n = up to 100 customer requests daily Each request called job specifies Start location p i Start time t i End location q i _ End time t i Group size D = (d ij ) is distance data matrix for day

Each job involves travel (possibly with stops), driver has to be available to group continuously Two bus types: 45 seat (20 available, for large groups) 15 seat (5 available, for small group) Stationed at two separate depots Company can also borrow buses from other vendors Duration of job = end time - start time Varies from half hour to 20 hours For 75% of jobs, duration is less than five hours Job Number: Serially in increasing order of start

Work-sequence: Sequence of jobs handled by a bus in a day Necessary condition for i 1,... i r to be a work- sequence: _ t {s+1} - t s > driving time from q s to p {s+1} for s = 1 to r-1 In this work sequence, the driver of bus from q s to p {s+1} for s = 1 to r called empty load drives _ Duration of this work-sequence: (depends on depot of bus) = t r - t 1 + (driving time from depot to p 1 ) + (driving time from q r to depot) Drivers prefer long duration work-sequences (more money). But company has safety limit = 12 hours. But 10% jobs are long > 11 hour duration. They are OK, because they have intermediate stops when driver can rest. Only long duration work-sequences with continuous driving (fatigue causing) problematic

Decisions to be made: Partition trips into work-sequences, each for a bus Allocate buses from two depots, (and outside vendors if necessary) to work- sequences

Objectives to Optimize min OBJ1 = number of buses to handle jobs = number work-sequences into which jobs partitioned min OBJ2 = total cost of empty load driving Keep OBJ3 = % of long duration work- sequences below 50 as far as possible

Representation Using Network G Each trip a node N = set of nodes Include arc (i, j) if bus can handle trip j after completing trip i A = set of arcs Leave long duration trips as isolated nodes G = (N, A) acyclic network (no directed cycles) Each work-sequence is a chain in G, and each chain (including single node chains) in G can be a work-sequence

How to minimize OBJ1? Can be minimized by finding a min chain cover for nodes of G (i.e., smallest number of chains containing all nodes) This problem transformed into a max bipartite matching problem, can be solved very efficiently

How to minimize OBJ2? OBJ2 = OBJ2.1 + OBJ2.2, OBJ2.1 is cost of empty load drives between consecutive jobs in work- sequence, OBJ2.2 is empty load drives from, to, depot i1i1 i2i2 i3i3 irir..

OBJ2.1 depends only on how jobs portioned into work-sequences for buses OBJ2.2 depends on from which source (depot 1, 2, outside vendor) buses allocated to work-sequences We minimize OBJ2.1, 2.2 in separate stages

How to minimize OBJ1, OBJ2.1 simultaneously? Find a min cost max matching in bipartite network, and use it to form work- sequences Can be solved efficiently using assignment algorithm

How to Handle OBJ3? OBJ3 makes problem hard. Even simpler problem of forming work-sequences with no long duration work sequences has been proved hard. Handle OBJ3 heuristically, manually (interactively) Removing longest arc, reapplying algorithm usually reduces % of long duration work sequences, while increasing OBJ1 only slightly Breaking some longest duration multi-trip work-sequences into two of reasonable durations, exchanging trips at beginning or end of some long duration ones to others, always yields good set, to implement

How to Minimize OBJ 2.2 Let WS 1,..., WS s be work-sequences in final solution set Let Depot 1, 2, OV (Outside Vendor) be sources of buses Knowing WS t, we can easily calculate value of OBJ 2.2 (cost of driving from source to starting location of first trip + from ending location of last trip back to source) for allocating bus from source to WS t, and model this problem as a 3 x s transportation problem

Strategy for the problem Our strategy is a 2-stage hierarchical process Stage 1: Select work sequences to implement, to min OBJ1, OBJ 2.1 simultaneously, by solving min cost max matching in bipartite network Modify work sequences obtained to satisfy OBJ 3 interactively by heuristic techniques Stage 2: Allocate buses from sources to selected work- sequences to min OBJ 2.2 by solving transportation model

How to Handle 2 Bus Sizes? 5 small 15 seat buses On days when more small buses needed, much cheaper to use one of company's large 45 seat buses than renting small bus Use following procedure: 1. Consider only small group jobs. Use algorithm to allocate small buses to these, up to 5 available 2. If any small group jobs unallocated, combine them with set of large group jobs and use algorithm to allocate large buses to this set

Results Previously decisions made manually, took two people Using DSS, solution time reduced to a few man- hours each day OBJ1 reduced by 15% from manual approach OBJ2 reduced by 10% from manual approach