The Hierarchical Traveling Salesman Problem

Slides:



Advertisements
Similar presentations
Vehicle Routing: Coincident Origin and Destination Points
Advertisements

An Introduction to Stochastic Vehicle Routing
1 SOFSEM 2007 Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles Eiji Miyano Kyushu Institute of Technology, Japan Joint.
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
DOMinant workshop, Molde, September 20-22, 2009
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
Transit Vehicle Routing Methods for Large-Scale Evacuation Mark Hickman and Moshe Dror University of Arizona INFORMS November 15, 2011.
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.
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
1 Optimization problems such as MAXSAT, MIN NODE COVER, MAX INDEPENDENT SET, MAX CLIQUE, MIN SET COVER, TSP, KNAPSACK, BINPACKING do not have a polynomial.
Vehicle Routing & Scheduling
Transportation Logistics Professor Goodchild Spring 2009.
A hybrid heuristic for an inventory routing problem C.Archetti, L.Bertazzi, M.G. Speranza University of Brescia, Italy A.Hertz Ecole Polytechnique and.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Job Shop Reformulation of Vehicle Routing Evgeny Selensky University of Glasgow
A Dynamic Messenger Problem Jan Fábry University of Economics Prague
Bruce L. Golden R.H. Smith School of Business University of Maryland Presented at DSI Annual Meeting November 2013 Baltimore, MD 1.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
1.3 Modeling with exponentially many constr.  Some strong formulations (or even formulation itself) may involve exponentially many constraints (cutting.
Branch & Bound UPPER =  LOWER = 0.
1 1 1-to-Many Distribution Vehicle Routing John H. Vande Vate Spring, 2005.
The Min-Max Multi-Depot Vehicle Routing Problem: Three-Stage Heuristic and Computational Results X. Wang, B. Golden, and E. Wasil INFORMS Minneapolis October,
1 A Guided Tour of Several New and Interesting Routing Problems by Bruce Golden, University of Maryland Edward Wasil, American University Presented at.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
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.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
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.
Bekkjarvik, A Heuristic Solution Method for a Stochastic Vehicle Routing Problem Lars Magnus Hvattum.
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.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
The Colorful Traveling Salesman Problem Yupei Xiong, Goldman, Sachs & Co. Bruce Golden, University of Maryland Edward Wasil, American University Presented.
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
L. Bertazzi, B. Golden, and X. Wang Route 2014 Denmark June
Traveling Salesman Problem (TSP)
Transportation Logistics Professor Goodchild Spring 2011.
1 1 1-to-Many Distribution Vehicle Routing Part 2 John H. Vande Vate Spring, 2005.
Log Truck Scheduling Problem
THE INVENTORY ROUTING PROBLEM
Vehicle Routing Problems
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
Approximation Algorithms for the Traveling Salesman Problem Shayan Oveis Gharan.
1 1 Vehicle Routing Part 2 John H. Vande Vate Fall, 2002.
Discrete Optimization MA2827 Fondements de l’optimisation discrète Material from P. Van Hentenryck’s course.
A Warehouse Location Routing Problem Jirawan Niemsakul (Jossef Perl: University of Maryland Presentation By: Mark S.Daskin: Northwestern University) &
Introduction to Graph & Network Theory Thinking About Networks: From Metabolism to the Genome to Social Conflict Summer Workshop for Teachers June 27 th.
More NP-Complete and NP-hard Problems
Integer Programming An integer linear program (ILP) is defined exactly as a linear program except that values of variables in a feasible solution have.
Optimization problems such as
Traveling Salesman Problems Motivated by Robot Navigation
Si Chen, University of Maryland Bruce Golden, University of Maryland
1.3 Modeling with exponentially many constr.
Integer Programming (정수계획법)
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
GEOP 4355 Distribution Problems
1.3 Modeling with exponentially many constr.
Planning the transportation of elderly to a daycare center
Branch and Bound Searching Strategies
Presented by Yi-Tzu, Chen
Solving the Minimum Labeling Spanning Tree Problem
Integer Programming (정수계획법)
Generating and Solving Very Large-Scale Vehicle Routing Problems
Topic 15 Job Shop Scheduling.
By Yupei Xiong, Damon Gulczynski, Bruce Golden, and Edward Wasil
Chapter 1. Formulations.
Vehicle routing in Python
Vehicle Routing John H. Vande Vate Fall,
A Neural Network for Car-Passenger matching in Ride Hailing Services.
Presentation transcript:

The Hierarchical Traveling Salesman Problem 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 of Maryland

Focus of Vehicle Routing Papers Heuristic approach Exact approach Hybrid approach Case study Worst-case analysis

Introduction Consider the distribution of relief aid E.g., food, bottled water, blankets, or medical packs The goal is to satisfy demand for relief supplies at many locations Try to minimize cost Take the urgency of each location into account

A Simple Model for Humanitarian Relief Routing Suppose we have a single vehicle which has enough capacity to satisfy the needs at all demand locations from a single depot Each node (location) has a known demand (for a single product called an aid package) and a known priority Priority indicates urgency Typically, nodes with higher priorities need to be visited before lower priority nodes

Node Priorities Priority 1 nodes are in most urgent need of service To begin, we assume Priority 1 nodes must be served before priority 2 nodes Priority 2 nodes must be served before priority 3 nodes, and so on Visits to nodes must strictly obey the node priorities

The Hierarchical Traveling Salesman Problem We call this model the Hierarchical Traveling Salesman Problem (HTSP) Despite the model’s simplicity, it allows us to explore the fundamental tradeoff between efficiency (distance) and priority (or urgency) in humanitarian relief and related routing problems A key result emerges from comparing the HTSP and TSP in terms of worst-case behavior

Four Scenarios for Node Priorities

Literature Review Psaraftis (1980): precedence constrained TSP Fiala Tomlin, Pulleyblank (1992): precedence constrained helicopter routing Campbell et al. (2008): relief routing Balcik et al. (2008): last mile distribution Ngueveu et al. (2010): cumulative capacitated VRP

A Relaxed Version of the HTSP  

Efficiency vs. Priority

Main Results  

Sketch of Proof (a) Tour τ* Length = Z*TSP

Sketch of Proof (a)  

Sketch of Proof of (b) Tour τ* Length = Z*TSP Tour τ* Length = Z*TSP

Sketch of Proof of (b)  

The General Result and Two Special Cases  

Worst-case Example

Conclusions and Extensions The worst-case example shows that the bounds in (a) and (b) are tight and cannot be improved The HTSP and several generalizations have been formulated as mixed integer programs HTSP instances with 30 or so nodes were solved to optimality using CPLEX Future work: capacitated vehicles, multiple products, a multi-day planning horizon, uncertainty with respect to node priorities