scispace - formally typeset
Search or ask a question
Topic

Arc routing

About: Arc routing is a research topic. Over the lifetime, 643 publications have been published within this topic receiving 19434 citations.


Papers
More filters
BookDOI
01 Jan 2008
TL;DR: In this article, the authors present a survey of the state-of-the-art approaches for solving the Capacitated Vehicle Routing Problem on trees and using a genetic algorithm to solve the generalized orienteering problem.
Abstract: Overviews and Surveys- Routing a Heterogeneous Fleet of Vehicles- A Decade of Capacitated Arc Routing- Inventory Routing- The Period Vehicle Routing Problem and its Extensions- The Split Delivery Vehicle Routing Problem: A Survey- Challenges and Advances in A Priori Routing- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography- Parallel Solution Methods for Vehicle Routing Problems- Recent Developments in Dynamic Vehicle Routing Systems- New Directions in Modeling and Algorithms- Online Vehicle Routing Problems: A Survey- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees- Using a Genetic Algorithm to Solve the Generalized Orienteering Problem- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems- Challenges and Opportunities in Attended Home Delivery- Chvatal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows- Vehicle Routing Problems with Inter-Tour Resource Constraints- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods- Practical Applications- Vehicle Routing for Small Package Delivery and Pickup Services- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation- Vehicle Routing Problems and Container Terminal Operations - An Update of Research

976 citations

Journal ArticleDOI
TL;DR: A GA without trip delimiters, hybridized with a local search procedure is proposed, which outperforms most published TS heuristics on the 14 classical Christofides instances and becomes the best solution method for the 20 large-scale instances generated by Golden et al.

974 citations

Journal ArticleDOI
01 Sep 1981-Networks
TL;DR: The intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems.
Abstract: A capacitated node routing problem, known as the vehicle routing or dispatch problem, has been the focus of much research attention On the other hand, capacitated arc routing problems have been comparatively neglected Both classes of problems are extremely rich in theory and applications Our intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems In addition, we identify several related routing problems and develop tight lower bounds on the optimal solution

519 citations

Book
01 Jan 1978
TL;DR: Introduction to Graphs and Networks Computer Representation and Solution Tree Algorithm Shortest-Path Algorithms Minimum-Cost Flow Al algorithms Matching and Assignment Al algorithms.
Abstract: Introduction to Graphs and Networks Computer Representation and Solution Tree Algorithms Shortest-Path Algorithms Minimum-Cost Flow Algorithms Matching and Assignment Algorithms The Postman and Related Arc Routing Problems The Traveling Salesman and Related Vertex Routing Problems Location Problems Project Networks NETSOLVE User's Manual

507 citations

Book
09 Jan 2004
TL;DR: In this article, the authors present an inventory management model based on the exponential smoothing method and a linear regression method, which is used to solve the problem of non-instantaneous resupply.
Abstract: Foreword.Preface.Abbreviations.Problems and Website.Acknowledgements.About the Authors.1 Introducing Logistics Systems.1.1 Introduction.1.2 How Logistics Systems Work.1.2.1 Order processing.1.2.2 Inventory management.1.2.3 Freight transportation.1.3 Logistics Managerial Issues.1.4 Emerging Trends in Logistics.1.5 Logistics Decisions.1.5.1 Decision support methods.1.5.2 Outline of the book.1.6 Questions and Problems.1.7 Annotated Bibliography.2 Forecasting Logistics Requirements.2.1 Introduction.2.2 Demand Forecasting Methods.2.2.1 Qualitative methods.2.2.2 Quantitative methods.2.2.3 Notation.2.3 Causal Methods.2.4 Time Series Extrapolation.2.4.1 Time series decomposition method.2.5 Further Time Series Extrapolation Methods: the Constant Trend Case.2.5.1 Elementary technique.2.5.2 Moving average method.2.5.3 Exponential smoothing method.2.5.4 Choice of the smoothing constant.2.5.5 The demand forecasts for the subsequent time periods.2.6 Further Time Series Extrapolation Methods: the Linear Trend Case.2.6.1 Elementary technique.2.6.2 Linear regression method.2.6.3 Double moving average method.2.6.4 The Holt method.2.7 Further Time Series Extrapolation Methods: the Seasonal Effect Case.2.7.1 Elementary technique.2.7.2 Revised exponential smoothing method.2.7.3 The Winters method.2.8 Advanced Forecasting Methods.2.9 Selection and Control of Forecasting Methods.2.9.1 Accuracy measures.2.9.2 Forecast control.2.10 Questions and Problems.2.11 Annotated Bibliography.3 Designing the Logistics Network.3.1 Introduction.3.2 Classification of Location Problems.3.3 Single-Echelon Single-Commodity Location Models.3.3.1 Linear transportation costs and facility fixed costs.3.3.2 Linear transportation costs and concave piecewise linear facility operating costs.3.4 Two-Echelon Multicommodity Location Models.3.5 Logistics Facility Location in the Public Sector.3.5.1 p-centre models.3.5.2 The location-covering model.3.6 Data Aggregation.3.7 Questions and Problems.3.8 Annotated Bibliography.4 Solving Inventory Management Problems.4.1 Introduction.4.2 Relevant Costs.4.3 Classification of Inventory Management Models.4.4 Single Stocking Point: Single-Commodity Inventory Models under Constant Demand Rate.4.4.1 Noninstantaneous resupply.4.4.2 Instantaneous resupply.4.4.3 Reorder point.4.5 Single Stocking Point: Single-Commodity Inventory Models under Deterministic Time-Varying Demand Rate.4.6 Models with Discounts.4.6.1 Quantity-discounts-on-all-units.4.6.2 Incremental quantity discounts.4.7 Single Stocking Point: Multicommodity Inventory Models.4.7.1 Models with capacity constraints.4.7.2 Models with joint costs.4.8 Stochastic Models.4.8.1 The Newsboy Problem.4.8.2 The (s, S) policy for single period problems.4.8.3 The reorder point policy.4.8.4 The periodic review policy.4.8.5 The (s, S) policy.4.8.6 The two-bin policy.4.9 Selecting an Inventory Policy.4.10 Multiple Stocking Point Models.4.11 Slow-Moving Item Models.4.12 Policy Robustness.4.13 Questions and Problems.4.14 Annotated Bibliography.5 Designing and Operating a Warehouse.5.1 Introduction.5.1.1 Internal warehouse structure and operations.5.1.2 Storage media.5.1.3 Storage/retrieval transport mechanisms and policies.5.1.4 Decisions support methodologies.5.2 Warehouse Design.5.2.1 Selecting the storage medium and the storage/retrieval transport mechanism.5.2.2 Sizing the receiving and shipment subsystems.5.2.3 Sizing the storage subsystems.5.3 Tactical Decisions.5.3.1 Product allocation.5.4 Operational Decisions.5.4.1 Batch formation.5.4.2 Order picker routing.5.4.3 Packing problems.5.5 Questions and Problems.5.6 Annotated Bibliography.6 Planning and Managing Long-Haul Freight Transportation.6.1 Introduction.6.2 Relevant Costs.6.3 Classification of Transportation Problems.6.4 Fleet Composition.6.5 Freight Traffic Assignment Problems.6.5.1 Minimum-cost flow formulation.6.5.2 Linear single-commodity minimum-cost flow problems.6.5.3 Linear multicommodity minimum-cost flow problems.6.6 Service Network Design Problems.6.6.1 Fixed-charge network design models.6.6.2 The linear fixed-charge network design model.6.7 Shipment Consolidation and Dispatching.6.8 Freight Terminal Design and Operations.6.8.1 Design issues.6.8.2 Tactical and operational issues.6.9 Vehicle Allocation Problems.6.10 The Dynamic Driver Assignment Problem.6.11 Questions and Problems.6.12 Annotated Bibliography.7 Planning and Managing Short-Haul Freight Transportation.7.1 Introduction.7.2 Vehicle Routing Problems.7.3 The Travelling Salesman Problem.7.3.1 The asymmetric travelling salesman problem.7.3.2 The symmetric travelling salesman problem.7.4 The Node Routing Problem with Capacity and Length Constraints.7.4.1 Constructive heuristics.7.5 The Node Routing and Scheduling Problem with TimeWindows.7.5.1 An insertion heuristic.7.5.2 A unified tabu search procedure for constrained node routing problems.7.6 Arc Routing Problems.7.6.1 The Chinese postman problem.7.6.2 The rural postman problem 2867.7 Real-Time Vehicle Routing and Dispatching.7.8 Integrated Location and Routing.7.9 Vendor-Managed Inventory Routing.7.10 Questions and Problems.7.11 Annotated Bibliography.8 Linking Theory to Practice.8.1 Introduction.8.2 Shipment Consolidation and Dispatching at ExxonMobil Chemical.8.3 Distribution Management at Pfizer.8.3.1 The Logistics System.8.3.2 The Italian ALFA10 distribution system.8.4 Freight Rail Transportation at Railion.8.5 Yard Management at the Gioia Tauro Marine Terminal.8.6 Municipal Solid Waste Collection and Disposal Management at the Regional Municipality of Hamilton-Wentworth.8.7 Demand Forecasting at Adriatica Accumulatori.8.8 Distribution Logistics Network Design at DowBrands.8.9 ContainerWarehouse Location at Hardcastle.8.10 Inventory Management atWolferine.8.11 Airplane Loading at FedEx.8.12 Container Loading atWaterworld.8.12.1 Packing rolls into containers.8.12.2 Packing pallets into containers.8.13 Air Network Design at Intexpress.8.14 Bulk-Cargo Ship Scheduling Problem at the US Navy.8.15 Meter Reader Routing and Scheduling at Socal.8.16 Annotated Bibliography.8.17 Further Case Studies.Index.

380 citations


Network Information
Related Topics (5)
Heuristics
32.1K papers, 956.5K citations
78% related
Supply chain
84.1K papers, 1.7M citations
77% related
Scheduling (computing)
78.6K papers, 1.3M citations
77% related
Supply chain management
39K papers, 1M citations
77% related
Genetic algorithm
67.5K papers, 1.2M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202311
202245
202145
202035
201944
201829