We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Thank you!
Presentation is loading. Please wait.
Published byDaniel Dougherty
Modified over 3 years ago
© Dr Evgeny Selensky, 2001 Motivation Hard industrially important problems Identify problem features making one technique better than the other Use domain knowledge, develop better heuristics and propagation to improve search Dr Evgeny Selensky University of Glasgow firstname.lastname@example.org Local Search Path Constraint Energetic Reasoning Disjunctive Scheduling Edge Finding Routing VRP Scheduling OSSP JSSP Problems Vehicle Routing Problem (VRP): Given: M identical vehicles initially located at the base, N customers with demands for goods. Find tours of minimal travel from base to all customers respecting capacity constraints on vehicles and time windows on customers. Shop Scheduling Problem: Given: M machines on factory floor, N jobs (sets of operations to be processed by a specified machine). Each operation has a given duration. Each machine can process without interruption only one operation at a time and each job can be processed on one machine at a time (capacity or disjunctive constraints). Schedule all operations such that the latest job is finished in minimal time (minimise makespan). Job Shop Scheduling Problem (JSSP): a job is a predefined chain of operations Open Shop Scheduling Problem (OSSP): order of operations is immaterial Tools Scheduler and Dispatcher
Outline of Study 1. Use default encoding of VRP 2. Reformulate VRP as OSSP and solve it with Scheduler 3.Use default encoding of JSSP 4.Reformulate JSSP as VRP and solve it with Dispatcher 5.Compare results Two extreme cases: VRP with zero distances, known vehicle assignments and predefined orders of visits (jobs); minimise the latest return time OSSP with non-zero setup times (distances between customers), alternative machines (vehicles) and time windows; minimise the sum of setups Reformulated Problems Platform: Microsoft Windows NT/Intel Pentium III 933 MHz, 1Gb RAM VRP as OSSP: Limited Discrepancy Search, Time Limit 3 hours Default VRP: Guided Local Search, Time Limit 3 hours JSSP as VRP: Guided Local Search, Time Limit 60 or 180 seconds Default JSSP: Complete Binary Search, Time Limit 60 or 180 seconds Experiments Tours on the plane for R103 Scheduling TechniqueRouting Technique © Dr Evgeny Selensky, 2001 * M. Solomon, 1987 VRP OSSP JSSP VRP * http://www.ms.ic.ac.uk/jeb/pub/jobshop1.txt
© Dr Evgeny Selensky, 2001 JSSP VRP More urban and specialised More rural and open Future Research Improve representations of pure JSSP and VRP by facilitating edge finder temporal reasoning and breaking symmetries Enhance search by using texture measurements and slack based heuristics Move from the extremes by enriching problems with realistic side constraints: Try mixing technologies, e.g., get first solution with the scheduling technique and improve it with the routing technique. Is it better? VRP: use instances with smaller distances and introduce classes of vehicles; JSSP: use instances with progressively greater interchangeability of machines and larger setup costs; Information Problem Reformulation and Search (PRAS) is an EPSRC funded project Project number: GR/M90641 Industrial collaborator:, France Duration: 3 years, 2000-2003 Web: http://www.dcs.gla.ac.uk/pras
Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow
Job Shop Reformulation of Vehicle Routing Evgeny Selensky.
Shop Scheduling Reformulation of Vehicle Routing Evgeny Selensky Dept of Computing Science Glasgow University.
Vehicle Routing & Job Shop Scheduling: Whats the Difference? ICAPS03, June 13, 2003 J. Christopher Beck, Patrick Prosser, & Evgeny Selensky Dept. of Computing.
Problem Reformulation and Search
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Tabu Search Applications Outlines: 1.Application of Tabu Search 2.Our Project with Tabu Search: EACIIT analytics.
Iterative Flattening in Cumulative Scheduling. Cumulative Scheduling Problem Set of Jobs Each job consists of a sequence of activities Each activity has.
Toshihide IBARAKI Mikio KUBO Tomoyasu MASUDA Takeaki UNO Mutsunori YAGIURA Effective Local Search Algorithms for the Vehicle Routing Problem with General.
VRP Vehicle Routing Problem. What is VRP Objective –Minimize routing costs.
Ant Colony Optimization Chapter 5 Ant Colony Optimization for NP- Hard Problems Ben Sauskojus.
Vehicle Routing & Scheduling
Vehicle Routing & Scheduling: Part 1
Lecture 10: Integer Programming & Branch-and-Bound
Vehicle Routing & Scheduling: Part 2 Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
Bekkjarvik, A Heuristic Solution Method for a Stochastic Vehicle Routing Problem Lars Magnus Hvattum.
The Travelling Salesman Problem (TSP)
On the Complexity of Scheduling
Simultaneous scheduling of machines and automated guided vehicles: graph modelling and resolution Philippe LACOMME, Mohand LARABI Nikolay TCHERNEV LIMOS.
On the Boundary of Planning and Scheduling: A Study Roman Barták Charles University, Prague
Vehicle Routing Problems. Traveling Salesperson Problem (TSP) vs. Vehicle Routing Problem (VRP) In TSP we sought a cycle through each node of a graph.
Vehicle Routing & Scheduling Multiple Routes Construction Heuristics –Sweep –Nearest Neighbor, Nearest Insertion, Savings –Cluster Methods Improvement.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael Sanders.
Roman Barták (Charles University in Prague, Czech Republic) ACAT 2010.
Previously in Chapter 6 Using binary variables Unintended options Lack of sensitivity analysis.
Graph Transformations for Vehicle Routing and Job Shop Scheduling Problems J.C.Beck, P.Prosser, E.Selensky
Logistics Network Configuration
A Set-Partitioning-Based Model and Solution Procedure for the SVRP Rosemary Berger, Jeff Linderoth, Clara Novoa and Bob Storer Department of Industrial.
Roman Barták Visopt B.V. (NL) / Charles University (CZ) IP&S in complex and dynamic areas Visopt Experience.
GRAPH BALANCING. Scheduling on Unrelated Machines J1 J2 J3 J4 J5 M1 M2 M3.
Transportation Logistics Professor Goodchild Spring 2011.
I am Patrick Prosser I am a senior lecturer at Glasgow (and Strathclyde till mid April) I teach algorithms & data structures in java I am a member of.
Characterizing the Distribution of Low- Makespan Schedules in the Job Shop Scheduling Problem Matthew J. Streeter Stephen F. Smith Carnegie Mellon 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.
Temporal Constraints Time and Time Again: The Many Ways to Represent Time James F Allen.
Lecture #4 (b) algorithm design strategies: Brute Force and Exhaustive Search.
Activity Scheduling and Control. Activity Scheduling & Control Input: MRP Manufacturing Orders (MO’s) Subject to Capacity Constraints, Not Purchase Orders.
1 Optimization Algorithms on a Quantum Computer A New Paradigm for Technical Computing Richard H. Warren, PhD Optimization.
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Optimal Rectangle Packing: A Meta-CSP Approach Chris Reeson Advanced Constraint Processing Fall 2009 By Michael D. Moffitt and Martha E. Pollack, AAAI.
UC San Diego / VLSI CAD Laboratory Incremental Multiple-Scan Chain Ordering for ECO Flip-Flop Insertion Andrew B. Kahng, Ilgweon Kang and Siddhartha Nath.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
A Hybrid Genetic Algorithm for the Periodic Vehicle Routing Problem with Time Windows Michel Toulouse 1,2 Teodor Gabriel Crainic 2 Phuong Nguyen 2 1 Oklahoma.
2-1 Scheduling Constraints. 2-2 Outline Activities Temporal constraints Resources Resource constraints (mono-activity) Resource constraints (two activities)
TraVEL eXPERTS SITE Proposal
Production Planning and control – ME 1009 Unit 1 Introduction.
Traveling Salesman Problem (TSP)
Heuristics with Mad queens and example from jssp.
© 2017 SlidePlayer.com Inc. All rights reserved.