Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow

Slides:



Advertisements
Similar presentations
Vehicle Routing & Job Shop Scheduling: Whats the Difference? ICAPS03, June 13, 2003 J. Christopher Beck, Patrick Prosser, & Evgeny Selensky Dept. of Computing.
Advertisements

© Dr Evgeny Selensky, 2001 Motivation Hard industrially important problems Identify problem features making one technique better than the other Use domain.
Problem Reformulation and Search
Graph Transformations for Vehicle Routing and Job Shop Scheduling Problems J.C.Beck, P.Prosser, E.Selensky
On the Complexity of Scheduling
Simultaneous scheduling of machines and automated guided vehicles: graph modelling and resolution Philippe LACOMME, Mohand LARABI Nikolay TCHERNEV LIMOS.
Lecture 6: Job Shop Scheduling Introduction
Michele Samorani Manuel Laguna. PROBLEM : In meta-heuristic methods that are based on neighborhood search, whenever a local optimum is encountered, the.
Computing Kemeny and Slater Rankings Vincent Conitzer (Joint work with Andrew Davenport and Jayant Kalagnanam at IBM Research.)
ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.
Lecture 10: Integer Programming & Branch-and-Bound
The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows D. Popović, M. Vidović, M. Nikolić DEPARTMENT OF LOGISTICS.
The 2 Period Travelling Salesman Problem Applied to Milk Collection in Ireland By Professor H P Williams,London School of Economics Dr Martin Butler, University.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
Characterizing the Distribution of Low- Makespan Schedules in the Job Shop Scheduling Problem Matthew J. Streeter Stephen F. Smith Carnegie Mellon University.
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.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 6 SCHEDULING E
Introduction to Evolutionary Computation  Genetic algorithms are inspired by the biological processes of reproduction and natural selection. Natural selection.
Vehicle Routing & Scheduling
© J. Christopher Beck Lecture 30: Scheduling Systems 1.
8-1 Problem-Solving Examples (Preemptive Case). 8-2 Outline Preemptive job-shop scheduling problem (P-JSSP) –Problem definition –Basic search procedure.
Modeling the Covering Test Problem Brahim Hnich, Steven Prestwich, and Evgeny Selensky Cork Constraint Computation Center UCC Supported by SFI.
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
1 Planning and Scheduling to Minimize Tardiness John Hooker Carnegie Mellon University September 2005.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
Job Shop Reformulation of Vehicle Routing Evgeny Selensky.
INTRODUCTION TO SCHEDULING
Toshihide IBARAKI Mikio KUBO Tomoyasu MASUDA Takeaki UNO Mutsunori YAGIURA Effective Local Search Algorithms for the Vehicle Routing Problem with General.
Authors: Weiwei Chen, Ewa Deelman 9th International Conference on Parallel Processing and Applied Mathmatics 1.
LOGO AAIA’2012 \ WCO’ – 12 september, 2012 S. Deleplanque, A. Quilliot. LIMOS, CNRS, BLAISE PASCAL UNIVERSITY, Clermont-Ferrand (FRANCE) Wrocław,
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Edward Kent Jason Atkin Rong Qi 1. Contents Vehicle Routing Problem VRP in Forestry Commissioning Loading Bay Constraints Ant Colony Optimisation Handing.
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results X. Wang, B. Golden, and E. Wasil INFORMS Minneapolis October,
MCS 312: NP Completeness and Approximation algorithms Instructor Neelima Gupta
Shop Scheduling Reformulation of Vehicle Routing Evgeny Selensky Dept of Computing Science Glasgow University.
Jobshop scheduling. We have a set of resources a set of jobs a job is a sequence of operations/activities sequence the activities on the resources.
Great Theoretical Ideas in Computer Science.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Algorithms and their Applications CS2004 ( )
PSO and ASO Variants/Hybrids/Example Applications & Results Lecture 12 of Biologically Inspired Computing Purpose: Not just to show variants/etc … for.
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results X. Wang, B. Golden, and E. Wasil POMS -May 4, 2013.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Decision Diagrams for Sequencing and Scheduling Andre Augusto Cire Joint work with David Bergman, Willem-Jan van Hoeve, and John Hooker Tepper School of.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Resource Constrained Project Scheduling Problem. Overview Resource Constrained Project Scheduling problem Job Shop scheduling problem Ant Colony Optimization.
K. Panchamgam, Y. Xiong, B. Golden*, and E. Wasil Presented at INFORMS Annual Meeting Charlotte, NC, November 2011 *R.H. Smith School of Business University.
The Colorful Traveling Salesman Problem Yupei Xiong, Goldman, Sachs & Co. Bruce Golden, University of Maryland Edward Wasil, American University Presented.
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.
1 Operation Scheduling- II The Multi-Machine Case Look! There are two machines.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
Optimizing Pheromone Modification for Dynamic Ant Algorithms Ryan Ward TJHSST Computer Systems Lab 2006/2007 Testing To test the relative effectiveness.
Constraints and Search Toby Walsh Cork Constraint Computation Centre (4C) Logic & AR Summer School, 2002.
Operational Research & ManagementOperations Scheduling Economic Lot Scheduling 1.Summary Machine Scheduling 2.ELSP (one item, multiple items) 3.Arbitrary.
Lagrangean Relaxation
Vehicle Routing Problems
Vehicle Routing Problem
Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Resolution of the Location Routing Problem C. Duhamel, P. Lacomme C. Prins, C. Prodhon Université de Clermont-Ferrand II, LIMOS, France Université de Technologie.
Balanced Billing Cycles and Vehicle Routing of Meter Readers by Chris Groër, Bruce Golden, Edward Wasil University of Maryland, College Park American University,
Clustering Data Streams A presentation by George Toderici.
Tabu Search Applications Outlines: 1.Application of Tabu Search 2.Our Project with Tabu Search: EACIIT analytics.
1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.
Scheduling Overview Conjunctive Graph; Potentials, properties and existence conditions; Methods for scheduling; Potential task method Pert method;
Jobshop scheduling.
Vehicle Routing and Job Shop Scheduling:
1.3 Modeling with exponentially many constr.
Topic 15 Job Shop Scheduling.
Presentation transcript:

Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow

Details of the Talk PRAS project Problems addressed Two-level Reformulation TSP graph transformations Experiments and results

PRAS project Problem Reformulation and Search Principal Investigator: Patrick Prosser Web site: Industrial collaborator:, France

Why bother? Try to understand problem structure Improve performance of solution techniques

Joint work with Patrick Prosser (University of Glasgow), John Christopher Beck (still ILOG, France but soon Cork Constraint Computation Center, Ireland) –submitted a paper to SARA 2002

Vehicle Routing Problem N identical vehicles of capacity C M customers with demands D i >0 Each vehicle serves subset of customers Side constraints may be present (e.g., time windows, precedence constraints) Find tours for subset of vehicles such that: all customers served, each once one tour per vehicle total distance minimal

Job Shop Scheduling Problem time Earliest start time Latest end time M machines, i = 1..M, M  2 N jobs each of S operations, j = 1..S, of duration d ij  j : O ij < O ij+1 (chain-type precedence constraints)  j : O ij requires specific resource No preemption Minimise makespan = LatestEnd - EasliestStart Open shop relaxation  j : start(O ij ) start(O ij+1 ) Multipurpose machines  j : O ij requires alternative resource

Similarities Execution of tasks Tasks use resource(s) and have durations Resources constrained by capacity Sets of alternative resources may exist Setups, temporal constraints on tasks present Solution is an assignment of tasks to resources, start times to tasks Similar minimisation criteria may be specified

Reformulation Machine Vehicle Operation Visit Operation duration Service time Transition time Distance

Previous Studies Scheduling and local search Davenport & Beck alternative resources (up to 8 alternatives) Focacci et al, alternative resources (up to 3 alternatives) and setups Selensky extreme cases of performance of the routing and scheduling techniques (25 alternatives, large setups)

Previous Studies. Outcome Local Search in general is better for routing problems Systematic search in general is better for scheduling problems

Why so huge a difference? Routing Scheduling many alternative resources few (or no) alternative resources large setups, small durations small (or no) setups, large durations few (or no) temporal relationships among activities many temporal relationships among activities (precedence constraints)

This work is the first step towards understanding why this happens

TSP graph transformations Purpose : build part of transition times into operation durations to improve performance of temporal reasoning Based on preservation of cost

Example. Order independent transformation* * Due to J.C.Beck

It preserves cost! Proof. 1. Assume

Possible 4-node cycles: , , , , , Consider : 2. Now let

We can always split any cycle into a set of pairs of 3-node cycles with a common edge and starting node as before Therefore for any n 3. Finally,

Example. Order dependent transformation* Lexicographic ordering of nodes: A,B,C,D * Due to P. Prosser

A Few More Remarks Both transformations change time bounds on operations We don’t know yet how order independent transformation changes time bounds Order dependent transformation makes a symmetric change: –earliest start –latest start

Experiments. Test bed Based on M.Solomon’s suite of 56 VRPTW benchmarks: classes C1, R1, RC1 – small capacities, short TWs classes C2, R2, RC2 – large capacities, wide TWs C1 (9 instances), C2 (8 instances) – clustered distribution of customers R1 (12 instances), R2 (11 instances) – random distribution of customers RC1 (8 instances), RC2 (8 instances) – random- clustered distribution of customers within a class, customer coordinates and demands are identical

Experiments. Tools (i) Scheduler 5.1 Scheduling Technology, core - global constraint propagation: –slack-based heuristics –edge finder –timetable constraints

Experiments. Tools (ii) Dispatcher 3.1 Routing Technology, core - local search –different first solution generation heuristics –plain local search, guided local search, tabu search –path constraints

Experiments. Layout (i) Windows NT, Intel Pentium III 933 MHz, 1Gb RAM Scheduler 5.1 Search for solutions: –Discrepancy Bounded Depth First Search –slack-based heuristics –Max cpu time of 600s Run each instance 4 times using: –No transformation –Lex ordering –MaxMin ordering –MinMin ordering

Experiments. Layout (ii) Windows NT, Intel Pentium III 933 MHz, 1Gb RAM Dispatcher 3.1 Search for solutions: –First solution generation using savings heuristic –Guided Local Search –Max cpu time of 600s Run each instance 4 times using: –No transformation –Lex ordering –MaxMin ordering –MinMin ordering

Scheduler Results Scheduler solutions to Solomon’s benchmarks. Average differences, % of the non-transformed costs. Black - lex, grey - maxmin, white - minmin ordering

Dispatcher Results Dispatcher solutions to Solomon’s benchmarks. Average differences, % of the non-transformed cost. Black - lex, grey - maxmin, white - minmin ordering

Analysis of Results For clustered problems Dispatcher’s performance degrades, Scheduler’s improves as expected Hard to draw any conclusions on the rest problems. We don’t have full control over instance structure. The test bed proved a bit peculiar for these experiments

Future Work Create our own problem generator with the purpose of being able to move from VRP to JSSP smoothly, varying: –width of time windows –customer locations –capacities –vehicle specialisation –precedence constraints on visits –rejection/acceptance of visits on a vehicle

Acknowledgements Thanks to Vincent Furnon ( ) and Barbara Smith (Huddersfield)

Thanks a lot! Any questions?