Routing problems: A bibliography

DOI10.1007/BF02098290zbMATH Open0839.90032DBLPjournals/anor/LaporteO95WikidataQ96173852 ScholiaQ96173852MaRDI QIDQ1908308FDOQ1908308

G. 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)

Cites Work

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

Cited In (54)

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

Uses Software

• TSPLIB
• OR-Library
• VRP
• GIDEON

Recommendations

• Recent results on Arc Routing Problems: An annotated bibliography 👍 👎
• Arc Routing Problems, Part I: The Chinese Postman Problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Routing problems: A bibliography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908308)