Chapter 1. Introduction
|
|
- Abner Horton
- 8 years ago
- Views:
Transcription
1
2 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) in a single transport chain (Bontekoning et al., 2004; Macharis and Bontekoning, 2004). The change of transportation modes is performed at specially designed terminals (also known as transshipment yards) by transferring the loading units without handling the freight itself. The route of intermodal transport is namely subdivided into the pre-, main-, and end-haulage, which denote the route segments from customer to terminal, terminal to terminal, and terminal to customer, respectively (refer to Figure 1.1). The main-haulage generally implies the longest traveling distance and is typically carried out by rail or maritime, whereas the preand end-haulage are handled by trucks (i.e., vehicles) to enable door-to-door transports. The pre- and end-haulage is also referred to as drayage. Fig. 1.1: Intermodal Freight Transportation
3 2 Chapter 1. Introduction An essence of intermodal transportation compared to the conventional unimodal transportation is the ability to combine the advantages of the distinct transportation systems. For example, road-rail intermodal transportation consolidates the flexibility of road transport for short distances and the high transportation capacity of rail for long distances. Intermodal freight transportation has received an increased attention, e.g., by support programs introduced by the European Commission s Directorate General for Mobility and Transport, to divert freight transportation from road to rail and maritime in order to reduce road congestion and environmental pollution (European Commission, 2007, 2011). However, despite of these efforts, the fraction of the overall freight transportation by rail is steadily declining, leveling off at around 10% in 2009, its lowest level since 1945 (Boysen et al., 2010; European Commission, 2007, 2011). Reasons include the lack of flexibility and reliability (e.g., train delays, variability of train sizes), as well as deficiencies in the technical operability between and within the different transportation modes (European Commission, 2007; Martínez et al., 2004). To increase the attractiveness of intermodal freight transportation, cost-effectiveness and an efficient handling of the integrated operational procedures are mandatory. In this thesis, we consider several operational planning problems that arise in intermodal freight transportation. Simply the efficient handling of the preand end-haulage will result, according to Cheung et al. (2008) and Morlok and Spasovic (1994), in a significant cost reduction. Despite of the short traveling distance, the pre- and end-haulage accounts for a large percentage (between 25% to 40%) of the total intermodal transportation costs and seriously affects the profitability of an intermodal service (Macharis and Bontekoning, 2004; Morlok and Spasovic, 1994). The operational planning problems that we address in this research are various routing problems that are encountered in the pre- and end-haulage, as well as a partitioning problem that arises at rail-rail transshipment yards.
4 1.1 Notation and Terminology Notation and Terminology We assume the reader is familiar with the general concepts of Operations Research (e.g., Domschke and Drexl (2007)), combinatorial optimization (e.g., Korte and Vygen (2006); Schrijver (2003)), graph theory (e.g., Gross and Yellen (2004)), complexity theory (e.g., Garey and Johnson (1979)), as well as with the fundamentals of linear (e.g., Bertsimas and Tsitsiklis (1997)), nonlinear (e.g., Bertsekas (1999)), and integer programming (e.g., Schrijver (1998)). In the following, we will shortly introduce the graph notation used throughout the thesis and give a brief overview of routing and partitioning problems Graph Notation The used graph notation follows standard combinatorial optimization books such as Korte and Vygen (2006) and Schrijver (2003) and is given as follows. Let G =(V,E) be an undirected graph, where V is a non-empty, finite set and E is a finite multiset of unordered pairs of elements of V. The elements of V are called vertices or nodes and the elements of E undirected edges. Each undirected edge e E is a two-element subset of V and is denoted by e =[u, v] with u, v V. A directed graph (or simply digraph) D =(V,A) consists of a set of vertices V and includes in contrast to an undirected graph a finite multiset A of ordered pairs of elements of V. The elements of A are called directed edges or arcs and are denoted by e =(u, v) A with u, v V. A mixed graph combines the elements of an undirected and a directed graph and is defined by a triple D =(V,E,A) that consists of a set of vertices V, a set of undirected edges E, and a set of directed edges A. The terminology of undirected and directed graphs directly applies to mixed graphs. Notice that throughout the thesis, the term graph either refers to an undirected, directed, or mixed graph; by an edge we mean an undirected or directed edge. We say that an edge e =[u, v] or e =(u, v) connects vertices u and v and vertices u and v are adjacent. For directed graphs, we furthermore say that
5 4 Chapter 1. Introduction an arc (u, v) goes from vertex u to vertex v or leaves vertex u and enters vertex v. The vertices u and v are called the endpoints of edge e. If vertex u is an endpoint of edge e, then u is said to be incident with e (or equivalently, e is incident with u). The degree of a vertex u gives the number of edges incident with u. In case of digraphs, the out-degree and the in-degree denote the number of arcs that leave and enter vertex u, respectively. Edges e and f are called incident, if they share at least a common vertex. Two or more edges that are incident to the same pair of vertices are called multiple edges. A loop is an edge that joins a single vertex to itself. Graphs without loops and without multiple edges are called simple graphs. A complete graph is a simple undirected graph where any two distinct vertices are adjacent. If U V and both endpoints of an edge e belong to U, wesaythatu spans edge e. Given an undirected or directed graph G =(V,E), awalk is a sequence of vertices and edges W =(v 0,e 1,v 1,...,e k,v k ) such that k 1 and e i = [v i 1,v i ] E or e i =(v i 1,v i ) E for i =1,...,k. To ease the formulation, we will sometimes represent a walk only by its vertices W =(v 0,...,v k ) or by its edges W =(e 1,...,e k ). The vertices v 0 and v k are called the start vertex and end vertex of W, respectively. Furthermore, the walk W is said to connect vertices v 0 and v k and is defined between vertices v 0 and v k. If vertices v 0,...,v k are all distinct, the walk is called a path. If v 0 = v k and v 1,...,v k 1 are all distinct, we refer to a walk as a cycle. A graph that contains no cycle is referred to as an acyclic graph and a graph with at least one cycle is referred to as a cyclic graph. In case of digraphs, the terms walk, path, and cycle, are sometimes extended to directed walk, directed path, and directed cycle, respectively. Let G = (V,E) denote an undirected or directed graph. A digraph G =(V,E ) with V V, E E and where [u, v] E or (u, v) E implies u, v V is called a subgraph of G. IfE includes all edges of G that are spanned by V, G is called an induced subgraph. For each directed graph D =(V,A), an underlying undirected graph G = (V,E) is defined on the same vertex set V and contains an edge [u, v] E for each arc (u, v) A. An undirected graph is connected, if there is a path that
6 1.1 Notation and Terminology 5 connects any two distinct vertices of V. A directed graph D =(V,A) is said to be (weakly) connected, if the underlying undirected graph is connected. Moreover, D is strongly connected, if a directed path is defined on D between any two distinct vertices of V. Finally, a graph G =(V,E) is called vertex-weighted, if a vertex weight w u R is assigned to each vertex u V. Analogously, a graph G =(V,E) is referred to as egde-weighted, ifanedge weight c uv R (or c(u, v) R) is assigned to each edge [u, v] E or (u, v) E. In terms of digraphs, we also say arc-weighted graph Routing Problems Routing problems are concerned with the efficient transportation of, e.g., commodities, goods, information, and/or people. The main objective is to find optimal routes, that minimize, e.g., the traveling distance, traveling time, and/or traveling cost and which respect several side constraints. The most studied routing problem is the traveling salesman problem (TSP) which may be stated as follows (refer, e.g., to Applegate et al. (2006)): Given is a depot and a set of customers along with the traveling distance between each pair of them. The traveling salesman problem is to find a vehicle route that starts and ends at the depot, visits all the customers exactly once, and minimizes the total distance traveled. A considerable amount of literature has been published on the TSP. These studies investigate different TSP variants, as well as different solution approaches. Handbooks on the TSP are, among others, given by Cook (2012), Gutin and Punnen (2002), Lawler et al. (1985), and Reinelt (1994). Reallife applications of the TSP arise, e.g., in logistics, telecommunications, and chip design (Applegate et al., 2006). The TSP is along with most routing problems NP-hard in the strong sense (refer, e.g., to Garey and Johnson (1979)). We furthermore differentiate between symmetric and asymmetric TSPs. In the symmetric TSP, the traveling distance between two customers is identical in both directions, i.e., the distance from customer A to customer B is
7 6 Chapter 1. Introduction equal to the distance from customer B to customer A. Different traveling distances may be incurred in the asymmetric TSP. The multiple traveling salesman problem (m-tsp) is a generalization of the TSP, where multiple vehicles may visit the customers and where each customer must be visited by exactly one vehicle. All vehicles start and end at the depot. In analogy to the TSP, we search for routes that minimize the total traveling distance. A list of real-life applications, as well as a thorough literature overview are reported by Bektas (2006). The vehicle routing problem (VRP) is in turn a generalization of the m-tsp that places side constraints on the vehicles and on the customers; capacities and demands are assigned to the vehicles and to the customers, respectively. In the VRP, we search for vehicle routes with minimum total traveling distance that fulfill the demand of the customers and where each route respects the vehicle capacity. The main known results on the vehicle routing problem are, e.g., summarized by Golden et al. (2008) and Toth and Vigo (2002). By imposing time windows on the customers, we obtain the vehicle routing problem with time windows (VRPTW). In the same manner, we obtain the TSPTW and the m-tsptw. Here, a vehicle has to visit a customer within a defined time window. The time windows are further differentiated in soft and hard time windows. Soft time windows can be violated by paying appropriate penalties, while hard time windows do not allow to visit a customer after the defined time window. In the latter case, if a vehicle arrives before the beginning of a time window, the vehicle has to wait. A survey on routing problems with time windows is, e.g., given by Toth and Vigo (2002). Vehicle routing problems that include a time component are also referred to as vehicle scheduling problems. Finally, the last considered variant of the routing problem is the pickupand-delivery problem (PDP). In PDPs, commodities, goods, and/or people have to be transported between origins and destinations. Savelsbergh and Sol (1995), Berbeglia et al. (2007), Parragh et al. (2008a), and Parragh et al. (2008b) provide detailed surveys of the recent literature, as well as classification schemes. We follow Berbeglia et al. (2007) by differentiating between
8 1.1 Notation and Terminology 7 many-to-many, one-to-many-to-one, and one-to-one PDPs. The most frequently encountered PDPs are the ones with a one-to-one structure where each, e.g., commodity has a defined pickup and delivery location. Problems of this type arise, e.g., in courier and door-to-door transportation (refer, e.g., to Cordeau and Laporte (2003)). The PDP with unit vehicle capacity, unit supply/demand of the customers, and a one-to-one correspondence is a special case since it can be transformed into an asymmetric TSP for a single vehicle and into an asymmetric m-tsp for multiple vehicles (Savelsbergh and Sol, 1995). In problems with a one-to-many-to-one relationship, commodities are initially located at the depot and are delivered to so-called delivery customers, whereas commodities that are picked up at pickup customers are destined to the depot. Real-world applications arise, e.g., in the delivery of beverages and the collection of empty bottles (refer, e.g., to Gendreau et al. (1999)). In PDPs with a many-to-many dependency, the supply (demand) of any pickup (delivery) customer can be accommodated by any other delivery (pickup) customer. Problems of this type arise in the preand end-haulage of intermodal freight transportation and are considered in this thesis. PDPs that generalize the TSP or the VRP are further denoted as pickup-and-delivery traveling salesman problem (PDTSP) or pickup-anddelivery vehicle routing problem (PDVRP), respectively. Variants of the introduced routing problems consider, e.g., different objectives, multiple depots, heterogeneous vehicles, unit vehicle capacity and/or unit customer supply and demand. In this thesis, we exclusively address routing problems with unit capacity and unit supply/demand of the vehicles and the customers, respectively, and refer to them as full-truckload routing problems (Parragh et al., 2008b). Finally, each presented routing problem has a graph theoretical interpretation. For example, an equivalent graph formulation of the symmetric traveling salesman problem is given as follows (refer, e.g., to Korte and Vygen (2006)): Given a complete graph G =(V,E) with edge weight c(u, v) R + for every edge [u, v] E, find a cycle W with minimum weight, [u,v] W c(u, v), that contains each vertex exactly once.
9 8 Chapter 1. Introduction Partitioning Problems Graph partitioning problems (or simply partitioning problems) are, in general, concerned with the partitioning of the vertex set of an undirected or a directed graph into disjoint subsets (also known as clusters) such that the sum of the arc weights within the clusters is maximized (or equivalently, the sum of the edge weights between different clusters is minimized). Graph partitioning problems arise in a wide area of applications, including VLSI (Very Large Scale Integration) design (Alpert and Kahng, 1995), qualitative data analysis (Grötschel and Wakabayashi, 1989, 1990), computer register allocation (Kernighan, 1971), and finite element computation (Ferreira et al., 1998). The problem instances that have motivated this research are encountered at rail-rail transshipment yards. In the thesis, we consider a variant of the graph partitioning problem, namely the acyclic partitioning problem. The acyclic partitioning problem is defined on an arc- and vertex-weighted digraph that searches for a partition of the vertex set such that the sum of the vertex weights within the clusters satisfies an upper bound and such that the sum of the arc weights within the clusters is maximized. Additionally, the digraph is enforced to partition into a directed, acyclic graph, i.e., a graph that contains no directed cycle. 1.2 Outline This thesis is divided into 5 chapters. Chapter 2 (Truck Scheduling Problem) is concerned with a routing problem that arises in the pre- and end-haulage of intermodal transportation and where containers need to be transported by trucks between customers and terminals and vice versa. A problem formulation based on a full-truckload pickup-and-delivery problem with time windows is presented, as well as a 2-stage heuristic solution approach. In Chapter 3 (1-Full-Truckload Pickup-and-Delivery Traveling Salesman Problem) we address a simplification of this routing problem, namely the one-commodity full-truckload pickup-and-delivery traveling salesman problem. We formulate this problem as an integer linear and an integer nonlinear programming
10 1.2 Outline 9 problem and suggest exact solution approaches based on the classical and the generalized Benders decomposition. In Chapter 4 (Acyclic Partitioning Problem) we focus on a partitioning problem that arises, among others, at rail-rail transshipment yards. We propose different problem formulations for this acyclic partitioning problem and introduce solution approaches based on a branch-and-bound and a branch-and-price framework. Finally, Chapter 5 (Summary) summarizes the thesis and gives an outlook of further research. The core chapters (Chapters 2-4) share the same outline: We first give a detailed problem description (Problem Description), state the relevant literature (Literature Review), and introduce the used notation (Notation). Thereafter we present several problem formulations (Mathematical Formulations) and propose solution approaches (Solution Approach(es)). We assess the quality of our solution approaches in a computational study (Computational Study) and end each chapter with a summary (Summary). All solution methods that are presented in the following were implemented in Java 2 under Windows XP and were run on an Intel Pentium Core 2 Duo, 2.2 GHz PC with 4 GB system memory. We used ILOG CPLEX 12.2 Concert Technology with default settings as standard solver.
Branch-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 informationTwo objective functions for a real life Split Delivery Vehicle Routing Problem
International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry
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 informationSocial Media Mining. Graph Essentials
Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures
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 informationINSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014
INSY 4970/7970/7976 Vehicle Routing & Logistics Spring 2014 Instructor: E-mail: Office: Office Hours: Dr. Chase Murray All e-mail communication will be handled via Canvas. 3301F Shelby (See Canvas) Teaching
More informationRouting in Line Planning for Public Transport
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARC E. PFETSCH RALF BORNDÖRFER Routing in Line Planning for Public Transport Supported by the DFG Research
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationFreight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry
Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Xiangshang Tong, Ph.D. Menlo Worldwide Logistics Kimberly Ellis, Ph.D. Virginia Tech Amy Brown Greer
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 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 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 informationOnline vehicle routing and scheduling with continuous vehicle tracking
Online vehicle routing and scheduling with continuous vehicle tracking Jean Respen, Nicolas Zufferey, Jean-Yves Potvin To cite this version: Jean Respen, Nicolas Zufferey, Jean-Yves Potvin. Online vehicle
More informationV. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005
V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer
More informationLecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
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 informationOn the k-path cover problem for cacti
On the k-path cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationDynamic Vehicle Routing in MATSim
Poznan University of Technology Department of Motor Vehicles and Road Transport ZPSiTD Dynamic Vehicle Routing in MATSim Simulation and Optimization Michal Maciejewski michal.maciejewski@put.poznan.pl
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 informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 10: Graphs
Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph
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 informationA Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem
A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem Campos,V., Corberán, A., Mota, E. Dep. Estadística i Investigació Operativa. Universitat de València. Spain Corresponding author:
More informationComputer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li
Computer Algorithms NP-Complete Problems NP-completeness The quest for efficient algorithms is about finding clever ways to bypass the process of exhaustive search, using clues from the input in order
More informationBranch-and-Price for the Truck and Trailer Routing Problem with Time Windows
Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows Sophie N. Parragh Jean-François Cordeau October 2015 Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows
More informationKEYWORD SEARCH OVER PROBABILISTIC RDF GRAPHS
ABSTRACT KEYWORD SEARCH OVER PROBABILISTIC RDF GRAPHS In many real applications, RDF (Resource Description Framework) has been widely used as a W3C standard to describe data in the Semantic Web. In practice,
More informationJUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS. Received December May 12, 2003; revised February 5, 2004
Scientiae Mathematicae Japonicae Online, Vol. 10, (2004), 431 437 431 JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS Ondřej Čepeka and Shao Chin Sung b Received December May 12, 2003; revised February
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationSecurity-Aware Beacon Based Network Monitoring
Security-Aware Beacon Based Network Monitoring Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi Graduate School of Informatics, Kyoto University, Kyoto, Japan Email: {sasaki, liang, nag}@amp.i.kyoto-u.ac.jp
More informationStrategic planning in LTL logistics increasing the capacity utilization of trucks
Strategic planning in LTL logistics increasing the capacity utilization of trucks J. Fabian Meier 1,2 Institute of Transport Logistics TU Dortmund, Germany Uwe Clausen 3 Fraunhofer Institute for Material
More informationOutline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits
Outline NP-completeness Examples of Easy vs. Hard problems Euler circuit vs. Hamiltonian circuit Shortest Path vs. Longest Path 2-pairs sum vs. general Subset Sum Reducing one problem to another Clique
More informationSPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE
SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH NATIONAL UNIVERSITY OF SINGAPORE 2012 SPANNING CACTI FOR STRUCTURALLY CONTROLLABLE NETWORKS NGO THI TU ANH (M.Sc., SFU, Russia) A THESIS
More informationMathematics for Algorithm and System Analysis
Mathematics for Algorithm and System Analysis for students of computer and computational science Edward A. Bender S. Gill Williamson c Edward A. Bender & S. Gill Williamson 2005. All rights reserved. Preface
More informationScheduling Shop Scheduling. Tim Nieberg
Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations
More informationA Service Design Problem for a Railway Network
A Service Design Problem for a Railway Network Alberto Caprara Enrico Malaguti Paolo Toth Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna Viale Risorgimento, 2-40136 - Bologna
More informationOptimising Patient Transportation in Hospitals
Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction
More informationA Quantitative Decision Support Framework for Optimal Railway Capacity Planning
A Quantitative Decision Support Framework for Optimal Railway Capacity Planning Y.C. Lai, C.P.L. Barkan University of Illinois at Urbana-Champaign, Urbana, USA Abstract Railways around the world are facing
More informationCourse on Social Network Analysis Graphs and Networks
Course on Social Network Analysis Graphs and Networks Vladimir Batagelj University of Ljubljana Slovenia V. Batagelj: Social Network Analysis / Graphs and Networks 1 Outline 1 Graph...............................
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 informationCMPSCI611: Approximating MAX-CUT Lecture 20
CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to
More information136 CHAPTER 4. INDUCTION, GRAPHS AND TREES
136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics
More informationA Constraint Programming based Column Generation Approach to Nurse Rostering Problems
Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,
More informationNew Exact Solution Approaches for the Split Delivery Vehicle Routing Problem
New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem Gizem Ozbaygin, Oya Karasan and Hande Yaman Department of Industrial Engineering, Bilkent University, Ankara, Turkey ozbaygin,
More informationMultiple Spanning Tree Protocol (MSTP), Multi Spreading And Network Optimization Model
Load Balancing of Telecommunication Networks based on Multiple Spanning Trees Dorabella Santos Amaro de Sousa Filipe Alvelos Instituto de Telecomunicações 3810-193 Aveiro, Portugal dorabella@av.it.pt Instituto
More informationCloud Computing is NP-Complete
Working Paper, February 2, 20 Joe Weinman Permalink: http://www.joeweinman.com/resources/joe_weinman_cloud_computing_is_np-complete.pdf Abstract Cloud computing is a rapidly emerging paradigm for computing,
More informationNan Kong, Andrew J. Schaefer. Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA
A Factor 1 2 Approximation Algorithm for Two-Stage Stochastic Matching Problems Nan Kong, Andrew J. Schaefer Department of Industrial Engineering, Univeristy of Pittsburgh, PA 15261, USA Abstract We introduce
More informationMinimizing costs for transport buyers using integer programming and column generation. Eser Esirgen
MASTER STHESIS Minimizing costs for transport buyers using integer programming and column generation Eser Esirgen DepartmentofMathematicalSciences CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG
More informationA Column Generation Model for Truck Routing in the Chilean Forest Industry
A Column Generation Model for Truck Routing in the Chilean Forest Industry Pablo A. Rey Escuela de Ingeniería Industrial, Facultad de Ingeniería, Universidad Diego Portales, Santiago, Chile, e-mail: pablo.rey@udp.cl
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 informationTheoretical Computer Science (Bridging Course) Complexity
Theoretical Computer Science (Bridging Course) Complexity Gian Diego Tipaldi A scenario You are a programmer working for a logistics company Your boss asks you to implement a program that optimizes the
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 informationA Sublinear Bipartiteness Tester for Bounded Degree Graphs
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite
More informationGraph Theory and Complex Networks: An Introduction. Chapter 06: Network analysis
Graph Theory and Complex Networks: An Introduction Maarten van Steen VU Amsterdam, Dept. Computer Science Room R4.0, steen@cs.vu.nl Chapter 06: Network analysis Version: April 8, 04 / 3 Contents Chapter
More informationIntermodal Transportation
Intermodal Transportation Teodor Gabriel Crainic ESG UQAM & CIRRELT - CRT CIRRELT Plan What are we talking about? Container-based intermodal transportation System design (location) Fleet Management (empties)
More informationHow To Solve A Minimum Set Covering Problem (Mcp)
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationSmall Maximal Independent Sets and Faster Exact Graph Coloring
Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science The Exact Graph Coloring Problem: Given an undirected
More informationChapter 4 Software Lifecycle and Performance Analysis
Chapter 4 Software Lifecycle and Performance Analysis This chapter is aimed at illustrating performance modeling and analysis issues within the software lifecycle. After having introduced software and
More informationThe Problem of Scheduling Technicians and Interventions in a Telecommunications Company
The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
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 informationTHE PROBLEM WORMS (1) WORMS (2) THE PROBLEM OF WORM PROPAGATION/PREVENTION THE MINIMUM VERTEX COVER PROBLEM
1 THE PROBLEM OF WORM PROPAGATION/PREVENTION I.E. THE MINIMUM VERTEX COVER PROBLEM Prof. Tiziana Calamoneri Network Algorithms A.y. 2014/15 2 THE PROBLEM WORMS (1)! A computer worm is a standalone malware
More informationShip Scheduling and Network Design for Cargo Routing in Liner Shipping
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 Ship Scheduling and Network Design for Cargo
More informationOn the Relationship between Classes P and NP
Journal of Computer Science 8 (7): 1036-1040, 2012 ISSN 1549-3636 2012 Science Publications On the Relationship between Classes P and NP Anatoly D. Plotnikov Department of Computer Systems and Networks,
More informationAdaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips
Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Alfredo Olivera, Omar Viera Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Herrera y Reissig
More informationCOORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN ABSTRACT
Technical Report #98T-010, Department of Industrial & Mfg. Systems Egnieering, Lehigh Univerisity (1998) COORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN Kadir Ertogral, S. David
More informationScheduling Home Health Care with Separating Benders Cuts in Decision Diagrams
Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
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. Doctoral course Optimization on graphs - Lecture 4.1. Giovanni Righini. January 17 th, 2013
Dynamic programming Doctoral course Optimization on graphs - Lecture.1 Giovanni Righini January 1 th, 201 Implicit enumeration Combinatorial optimization problems are in general NP-hard and we usually
More informationHow To Solve The Line Connectivity Problem In Polynomatix
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER MARIKA NEUMANN MARC E. PFETSCH The Line Connectivity Problem Supported by the DFG Research
More informationFrans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages
Frans J.C.T. de Ruiter, Norman L. Biggs Applications of integer programming methods to cages Article (Published version) (Refereed) Original citation: de Ruiter, Frans and Biggs, Norman (2015) Applications
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationA Fast Algorithm For Finding Hamilton Cycles
A Fast Algorithm For Finding Hamilton Cycles by Andrew Chalaturnyk A thesis presented to the University of Manitoba in partial fulfillment of the requirements for the degree of Masters of Science in Computer
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 informationApproximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs Yong Zhang 1.2, Francis Y.L. Chin 2, and Hing-Fung Ting 2 1 College of Mathematics and Computer Science, Hebei University,
More informationTree-representation of set families and applications to combinatorial decompositions
Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no
More informationEffective Local Search Algorithms for Routing and Scheduling Problems with General Time Window Constraints
Effective Local Search Algorithms for Routing and Scheduling Problems with General Time Window Constraints T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno and M. Yagiura Department of Applied Mathematics
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 information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
More informationOptimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing
Optimal Bandwidth Reservation in Hose-Model VPNs with -Path Routing Thomas Erlebach Computer Engineering and Networks Laboratory (TIK) Dept. of Information Technology and Electrical Engineering ETH Zürich,
More informationPage 1. CSCE 310J Data Structures & Algorithms. CSCE 310J Data Structures & Algorithms. P, NP, and NP-Complete. Polynomial-Time Algorithms
CSCE 310J Data Structures & Algorithms P, NP, and NP-Complete Dr. Steve Goddard goddard@cse.unl.edu CSCE 310J Data Structures & Algorithms Giving credit where credit is due:» Most of the lecture notes
More informationComplexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar
Complexity Theory IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar Outline Goals Computation of Problems Concepts and Definitions Complexity Classes and Problems Polynomial Time Reductions Examples
More informationApproximation Algorithms
Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms
More information1 Introduction. Dr. T. Srinivas Department of Mathematics Kakatiya University Warangal 506009, AP, INDIA tsrinivasku@gmail.com
A New Allgoriitthm for Miiniimum Costt Liinkiing M. Sreenivas Alluri Institute of Management Sciences Hanamkonda 506001, AP, INDIA allurimaster@gmail.com Dr. T. Srinivas Department of Mathematics Kakatiya
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 informationHigh Performance Computing for Operation Research
High Performance Computing for Operation Research IEF - Paris Sud University claude.tadonki@u-psud.fr INRIA-Alchemy seminar, Thursday March 17 Research topics Fundamental Aspects of Algorithms and Complexity
More informationImpact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times
Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times Jean Respen Nicolas Zufferey Jean-Yves Potvin January 2014 Impact of Online Tracking on a Vehicle Routing Problem with Dynamic
More informationComputer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there
More informationGraph/Network Visualization
Graph/Network Visualization Data model: graph structures (relations, knowledge) and networks. Applications: Telecommunication systems, Internet and WWW, Retailers distribution networks knowledge representation
More informationOn the independence number of graphs with maximum degree 3
On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs
More informationScheduling and Routing Milk from Farm to Processors by a Cooperative
Journal of Agribusiness 22,2(Fall 2004):93S106 2004 Agricultural Economics Association of Georgia Scheduling and Routing Milk from Farm to Processors by a Cooperative Peerapon Prasertsri and Richard L.
More informationSocial Media Mining. Network Measures
Klout Measures and Metrics 22 Why Do We Need Measures? Who are the central figures (influential individuals) in the network? What interaction patterns are common in friends? Who are the like-minded users
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationInfluences of Communication Disruptions on Decentralized Routing in Transport Logistics
Influences of Communication Disruptions on Decentralized Routing in Transport Logistics Bernd Scholz-Reiter, Christian Zabel BIBA Bremer Institut für Produktion und Logistik GmbH University of Bremen Hochschulring
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationOptimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice
Optimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice G. Ayorkor Korsah, Anthony Stentz, M. Bernardine Dias, and Imran Fanaswala Abstract To realize the vision of intelligent
More information