Routing problems: A bibliography

DOI10.1007/BF02098290zbMath0839.90032WikidataQ96173852 ScholiaQ96173852MaRDI QIDQ1908308

Gilbert Laporte, Ibrahim. H Osman

Publication date: 23 June 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

vehicle routingtraveling salesmanChinese postmanrural postman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

ARMS: an automated resource management system for British telecommunications plc, Rich vehicle routing problems: from a taxonomy to a definition, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, The bi-objective mixed capacitated general routing problem with different route balance criteria, Applying the attribute based hill climber heuristic to the vehicle routing problem, An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Optimization of the technician routing and scheduling problem for a telecommunication industry, Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator, Proper balance between search towards and along Pareto front: biobjective TSP case study, Metaheuristics: A bibliography, A min-max vehicle routing problem with split delivery and heterogeneous demand, Self-organizing feature maps for the vehicle routing problem with backhauls, Routing and scheduling field service operation by P-graph, UAV routing by simulation-based optimization approaches for forest fire risk mitigation, Multi-depot vessel routing problem in a direction dependent wavefield, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, Some Thoughts on Research Directions for the Future: Introduction to the Special Issue in Maritime Transportation, The vehicle routing problem with time windows and flexible delivery locations, Optimisation d'un réseau de logistique inverse pour le transport des matières dangereuses résiduelles, Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles, Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence, New mathematical models of the generalized vehicle routing problem and extensions, Solving a fuel delivery problem by heuristic and exact approaches., On Eulerian extensions and their application to no-wait flowshop scheduling, Vyacheslav Tanaev: contributions to scheduling and related areas, Visiting a network of services with time constraints., Synchronized routing of seasonal products through a production/distribution network, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Real-time split-delivery pickup and delivery time window problems with transfers, Steiner diagrams and \(k\)-star hubs, Comparing descent heuristics and metaheuristics for the vehicle routing problem, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Ship scheduling with soft time windows: An optimisation based approach, Formulations and valid inequalities for the heterogeneous vehicle routing problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Modelling vehicle routing in GIS, A metaheuristic algorithm to transporter scheduling for assembly blocks in a shipyard considering precedence and cooperating constraints, Extensions to the generalised assignment heuristic for vehicle routing, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns, Stochastic vehicle routing, AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS, A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands, Stronger \(K\)-tree relaxations for the vehicle routing problem, A sweep-based algorithm for the fleet size and mix vehicle routing problem, The periodic vehicle routing problem with intermediate facilities, A visual interactive approach to vehicle routing, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A genetic algorithm for the vehicle routing problem

Uses Software

• TSPLIB
• OR-Library
• VRP
• GIDEON

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
• The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
• A Note on Bounds for Direct Shipping Cost
• A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
• An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
• A Heuristic for the Periodic Vehicle Routing Problem
• Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
• The Vehicle Routing Problem with Stochastic Travel Times
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Capacitated Arc Routing Problem: Lower bounds
• On the Distance Constrained Vehicle Routing Problem
• Fast Algorithms for Geometric Traveling Salesman Problems
• An Optimal Algorithm for the Orienteering Tour Problem
• Fast Heuristics for Large Geometric Traveling Salesman Problems
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
• Dynamic Optimization of Vehicle Fleet Size
• On the complexity of edge traversing
• On a Fleet Sizing and Allocation Problem
• A fundamental problem in vehicle routing
• Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
• The Vehicle Scheduling Problem and Monte Carlo Simulation
• Approximation Algorithms for Some Postman Problems
• Vehicle routing with stochastic demands and restricted failures
• An Efficient Transformation Of The Generalized Traveling Salesman Problem
• An Exact Algorithm for the Vehicle Routing Problem with Backhauls
• Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
• Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
• A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items
• State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
• The Delivery Man Problem and Cumulative Matroids
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• Parallel iterative search methods for vehicle routing problems
• Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
• A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows
• Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
• Probabilistic Analysis of a Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A Repeated Matching Heuristic for the Vehicle Routeing Problem
• Provably good solutions for the traveling salesman problem
• Time‐dependent traveling salesman problem–the deliveryman case
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
• A GRASP for the Vehicle Routing Problem with Time Windows
• The General Pickup and Delivery Problem
• Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
• A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing
• Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Arc Routing Problems, Part I: The Chinese Postman Problem
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
• Arc Routing Problems, Part II: The Rural Postman Problem
• An optimal algorithm for the mixed Chinese postman problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• The m-Traveling Salesman Problem with Minmax Objective
• Optimal tour planning with specified nodes
• A new heuristic for the traveling salesman problem
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Extensions of the Petal Method for Vehicle Routeing
• The traveling salesman problem with cumulative costs
• Bounds for the general capacitated routing problem
• Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
• A Class of Euclidean Routing Problems with General Route Cost Functions
• A Priori Optimization
• A Vehicle Routing Problem with Stochastic Demand
• Solving real-life vehicle routing problems efficiently using tabu search
• Incorporating vehicle into the vehicle routing fleet composition problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• Heuristic approaches to vehicle routing with backhauls and time windows
• The Truck Dispatching Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Split delivery routing
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• Fixed Routes
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The period routing problem
• Scheduling School Buses
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• A Combined Vehicle Routing and Inventory Allocation Problem
• RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS
• A Model for Fleet Sizing and Vehicle Allocation
• Locational equilibrium of two facilities on a tree
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Routing and Scheduling on a Shoreline with Release Times
• Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art
• On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
• The traveling salesman problem on a graph and some related integer polyhedra
• Routing with time windows by column generation
• Optimal Routing under Capacity and Distance Restrictions
• Eulerian Orientations and Circulations
• On finding spanning eulerian subgraphs
• Bounds and Heuristics for Capacitated Routing Problems
• The complexity of the travelling repairman problem
• A new heuristic for determining fleet size and composition
• Using simulated annealing to solve routing and location problems
• Generalized Subtour Elimination Constraints and Connectivity Constraints
• An algorithm for the Rural Postman problem on a directed graph
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Modeling Distribution Problems with Time Windows: Part I
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Pickup and Delivery of Partial Loads with “Soft” Time Windows
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
• A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
• Vehicle Routing with Time Windows
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
• On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
• An exact algorithm for the asymmetrical capacitated vehicle routing problem
• Generating Travelling-Salesman Problems with Known Optimal Tours
• The Vehicle Scheduling Problem with Multiple Vehicle Types
• Postman tour on a graph with precedence relation on arcs
• The orienteering problem
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Dynamic Location-routeing Problems
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• An Integrated Inventory Allocation and Vehicle Routing Problem
• Savings by Split Delivery Routing
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• The Capacitated Canadian Postman Problem
• The prize collecting traveling salesman problem
• The Chinese Postman Problem for Mixed Networks
• State-space relaxation procedures for the computation of bounds to routing problems
• Capacitated arc routing problems
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Covering Graphs by Simple Circuits
• Vehicle Fleet Composition
• Parallel Savings Based Heuristics for the Delivery Problem
• A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
• Capacitated Vehicle Routing on Trees
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• A multiphase approach to the period routing problem
• THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
• Special cases of traveling salesman and repairman problems with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces
• An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the capacitated vehicle routing problem
• A Lagrangean relaxation heuristic for vehicle routing
• Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
• Polyhedral study of the capacitated vehicle routing problem
• A modified Lin--Kernighan traveling-salesman heuristic
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Implementing an insertion heuristic for vehicle routing on parallel hardware
• The mixed postman problem
• A parallel insert method for the capacitated arc routing problem
• A comparison of techniques for solving the fleet size and mix vehicle routing problem
• On the windy postman problem
• Integer linear programming formulation for a vehicle routing problem
• A cubic algorithm for the directed Eulerian subgraph problem
• The arc partitioning problem
• Solution of large-scale symmetric travelling salesman problems
• The selective travelling salesman problem
• Classification of travelling salesman problem formulations
• A classification scheme for vehicle routing and scheduling problems
• An efficient implementation of local search algorithms for constrained routing problems
• Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
• Facet identification for the symmetric traveling salesman polytope
• Stochastic vehicle routing: A comprehensive approach
• Vehicle routing via column generation
• The fleet size and mix problem for capacitated arc routing
• Stochastic vehicle routing with modified savings algorithm
• Methods for routing with time windows
• Probabilistic exchange algorithms and Euclidean traveling salesman problems
• The fleet size and mix vehicle routing problem
• Implementation techniques for the vehicle routing problem
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• The savings algorithm for the vehicle routing problem
• Vehicle routing with full loads
• A bi-criteria heuristic for the vehicle routing problem with time windows
• Vehicle routing considerations in distribution system design
• A new class of cutting planes for the symmetric travelling salesman problem
• The effect of ignoring routes when locating depots
• A new algorithm for the directed Chinese postman problem
• Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• ALTO: A computer system for the design of vehicle routing algorithms
• The vehicle routing problem with backhauls
• On the windy postman problem on Eulerian graphs
• Algorithms to solve the orienteering problem: A comparison
• Vehicles scheduling with sliding time windows
• Approximate solutions for the capacitated arc routing problem
• Models and exact solutions for a class of stochastic location-routing problems
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
• Polyhedral results for a vehicle routing problem
• The pickup and delivery problem with time windows
• An analytical comparison of different formulations of the travelling salesman problem
• The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
• An additive bounding procedure for the asymmetric travelling salesman problem
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• The traveling salesman problem: An overview of exact and approximate algorithms
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• Traveling salesman problem and local search
• Tight integral duality gap in the Chinese postman problem
• Large-step Markov chains for the TSP incorporating local search heuristics
• The stochastic vehicle routing problem revisited
• A practical heuristic for a large scale vehicle routing problem
• A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
• The vehicle routing problem: An overview of exact and approximate algorithms
• Quick updates for \(p\)-opt TSP heuristics
• A cutting plane algorithm for the windy postman problem
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
• Routeing winter gritting vehicles
• On the mixed Chinese postman problem
• Entwicklung eines hybriden genetischen Algorithmus zur Tourenplanung
• Vehicle routing with split deliveries
• Strong linear programming relaxations for the orienteering problem
• A parallel tabu search algorithm for large traveling salesman problems
• A heuristic solution to the warehouse location-routing problem
• The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
• Use of a fuzzy theory technique for grouping of trips in the vehicle routing and scheduling problem
• Algorithms for the windy postman problem
• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• A branch-and-cut algorithm for vehicle routing problems
• A polyhedral approach to the rural postman problem
• Tabu search performance on the symmetric travelling salesman problem
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• The capacitated arc routing problem: Valid inequalities and facets
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• Integer linear programming formulation for vehicle routing problems
• Transforming arc routing into node routing problems
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• Microcomputer-based vehicle routing and scheduling software
• Asymptotic expected performance of some TSP heuristics: An empirical evaluation
• Heuristic methods and applications: A categorized survey
• New lower bounds for the symmetric travelling salesman problem
• k-interchange procedures for local search in a precedence-constrained routing problem
• The traveling salesman problem with backhauls
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• A tabu search heuristic for the multi-depot vehicle routing problem
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• A new heuristic for the fleet size and mix vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Augment-insert algorithms for the capacitated arc routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem