Recommendations
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 4172715 (Why is no real title available?)
- scientific article; zbMATH DE number 3648431 (Why is no real title available?)
- scientific article; zbMATH DE number 3883903 (Why is no real title available?)
- scientific article; zbMATH DE number 3871059 (Why is no real title available?)
- scientific article; zbMATH DE number 3878634 (Why is no real title available?)
- scientific article; zbMATH DE number 3880464 (Why is no real title available?)
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3984951 (Why is no real title available?)
- scientific article; zbMATH DE number 4047422 (Why is no real title available?)
- scientific article; zbMATH DE number 4047423 (Why is no real title available?)
- scientific article; zbMATH DE number 4051316 (Why is no real title available?)
- scientific article; zbMATH DE number 4057252 (Why is no real title available?)
- scientific article; zbMATH DE number 4061010 (Why is no real title available?)
- scientific article; zbMATH DE number 4066603 (Why is no real title available?)
- scientific article; zbMATH DE number 4068590 (Why is no real title available?)
- scientific article; zbMATH DE number 4085396 (Why is no real title available?)
- scientific article; zbMATH DE number 3724496 (Why is no real title available?)
- scientific article; zbMATH DE number 52971 (Why is no real title available?)
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 3504658 (Why is no real title available?)
- scientific article; zbMATH DE number 3600081 (Why is no real title available?)
- scientific article; zbMATH DE number 4125195 (Why is no real title available?)
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- scientific article; zbMATH DE number 279304 (Why is no real title available?)
- scientific article; zbMATH DE number 956790 (Why is no real title available?)
- scientific article; zbMATH DE number 3068971 (Why is no real title available?)
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Class of Euclidean Routing Problems with General Route Cost Functions
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A Combined Vehicle Routing and Inventory Allocation Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A GRASP for the Vehicle Routing Problem with Time Windows
- A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows
- A Heuristic for the Periodic Vehicle Routing Problem
- A Lagrangean relaxation heuristic for vehicle routing
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems
- A Model for Fleet Sizing and Vehicle Allocation
- A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Note on Bounds for Direct Shipping Cost
- A Priori Optimization
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands
- A Repeated Matching Heuristic for the Vehicle Routeing Problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Vehicle Routing Problem with Stochastic Demand
- A bi-criteria heuristic for the vehicle routing problem with time windows
- A branch and bound algorithm for the capacitated vehicle routing problem
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- A branch-and-cut algorithm for vehicle routing problems
- A classification scheme for vehicle routing and scheduling problems
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- A cubic algorithm for the directed Eulerian subgraph problem
- A cutting plane algorithm for the windy postman problem
- A fundamental problem in vehicle routing
- A heuristic solution to the warehouse location-routing problem
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
- A modified Lin--Kernighan traveling-salesman heuristic
- A multiphase approach to the period routing problem
- A new algorithm for the directed Chinese postman problem
- A new class of cutting planes for the symmetric travelling salesman problem
- A new heuristic for determining fleet size and composition
- A new heuristic for the fleet size and mix vehicle routing problem
- A new heuristic for the traveling salesman problem
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- A parallel insert method for the capacitated arc routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A parallel tabu search algorithm for large traveling salesman problems
- A polyhedral approach to the rural postman problem
- A practical heuristic for a large scale vehicle routing 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 set‐partitioning‐based exact algorithm for the vehicle routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- ALTO: A computer system for the design of vehicle routing algorithms
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Algorithms for the windy postman problem
- Algorithms to solve the orienteering problem: A comparison
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
- An Integrated Inventory Allocation and Vehicle Routing Problem
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- An Optimal Algorithm for the Orienteering Tour Problem
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- An additive bounding procedure for the asymmetric travelling salesman problem
- An algorithm for the Rural Postman problem on a directed graph
- An analytical comparison of different formulations of the travelling salesman problem
- An efficient implementation of local search algorithms for constrained routing problems
- An exact algorithm for the asymmetrical capacitated vehicle routing problem
- An optimal algorithm for the mixed Chinese postman problem
- Approximate solutions for the capacitated arc routing problem
- Approximation Algorithms for Some Postman Problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- Augment-insert algorithms for the capacitated arc routing problem
- Bounds and Heuristics for Capacitated Routing Problems
- Bounds for the general capacitated routing problem
- Capacitated Vehicle Routing on Trees
- Capacitated arc routing problems
- Classification of travelling salesman problem formulations
- Covering Graphs by Simple Circuits
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce
- Dynamic Location-routeing Problems
- Dynamic Optimization of Vehicle Fleet Size
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Entwicklung eines hybriden genetischen Algorithmus zur Tourenplanung
- Eulerian Orientations and Circulations
- Eulerian graphs and related topics. Part 1, Volume 1
- Eulerian graphs and related topics. Part 1, Volume 2
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Extensions of the Petal Method for Vehicle Routeing
- Facet identification for the symmetric traveling salesman polytope
- Fast Algorithms for Geometric Traveling Salesman Problems
- Fast Heuristics for Large Geometric Traveling Salesman Problems
- Fixed Routes
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
- Generating Travelling-Salesman Problems with Known Optimal Tours
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- Heuristic approaches to vehicle routing with backhauls and time windows
- Heuristic methods and applications: A categorized survey
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Implementation techniques for the vehicle routing problem
- Implementing an insertion heuristic for vehicle routing on parallel hardware
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Incorporating vehicle into the vehicle routing fleet composition problem
- Integer linear programming formulation for a vehicle routing problem
- Integer linear programming formulation for vehicle routing problems
- Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Large-step Markov chains for the TSP incorporating local search heuristics
- Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art
- Locational equilibrium of two facilities on a tree
- Matching, Euler tours and the Chinese postman
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Methods for routing with time windows
- Microcomputer-based vehicle routing and scheduling software
- Modeling Distribution Problems with Time Windows: Part I
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Models and exact solutions for a class of stochastic location-routing problems
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Networks and vehicle routing for municipal waste collection
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- New lower bounds for the symmetric travelling salesman problem
- On a Fleet Sizing and Allocation Problem
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- On finding spanning eulerian subgraphs
- On the Distance Constrained Vehicle Routing Problem
- On the complexity of edge traversing
- On the mixed Chinese postman problem
- On the windy postman problem
- On the windy postman problem on Eulerian graphs
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Optimal Routing under Capacity and Distance Restrictions
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Optimal tour planning with specified nodes
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- 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
- Parallel Savings Based Heuristics for the Delivery Problem
- Parallel iterative search methods for vehicle routing problems
- Pickup and Delivery of Partial Loads with “Soft” Time Windows
- Polyhedral results for a vehicle routing problem
- Polyhedral study of the capacitated vehicle routing problem
- Postman tour on a graph with precedence relation on arcs
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows
- Probabilistic Analysis of a Vehicle Routing Problem with Time Windows
- Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Provably good solutions for the traveling salesman problem
- Quick updates for \(p\)-opt TSP heuristics
- RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Routeing winter gritting vehicles
- Routing and Scheduling on a Shoreline with Release Times
- Routing with time windows by column generation
- Savings by Split Delivery Routing
- Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
- Scheduling School Buses
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Single-Vehicle Routing and Scheduling to Minimize the Number of Delays
- Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
- Solution of large-scale symmetric travelling salesman problems
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
- Solving real-life vehicle routing problems efficiently using tabu search
- Special cases of traveling salesman and repairman problems with time windows
- Split delivery routing
- State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
- State-space relaxation procedures for the computation of bounds to routing problems
- Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
- Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
- Stochastic vehicle routing with modified savings algorithm
- Stochastic vehicle routing: A comprehensive approach
- Strong linear programming relaxations for the orienteering problem
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- TSPLIB—A Traveling Salesman Problem Library
- Tabu search performance on the symmetric travelling salesman problem
- Technical Note—An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- The m-Traveling Salesman Problem with Minmax Objective
- The Capacitated Arc Routing Problem: Lower bounds
- The Capacitated Canadian Postman Problem
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- The Chinese Postman Problem for Mixed Networks
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- The Delivery Man Problem and Cumulative Matroids
- The General Pickup and Delivery Problem
- The Vehicle Routing Problem with Stochastic Travel Times
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- The Vehicle Scheduling Problem and Monte Carlo Simulation
- The Vehicle Scheduling Problem with Multiple Vehicle Types
- The arc partitioning problem
- The capacitated arc routing problem: Valid inequalities and facets
- The complexity of the travelling repairman problem
- The effect of ignoring routes when locating depots
- The fleet size and mix problem for capacitated arc routing
- The fleet size and mix vehicle routing problem
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- The mixed postman problem
- The orienteering problem
- The period routing problem
- The pickup and delivery problem with time windows
- The prize collecting traveling salesman problem
- The savings algorithm for the vehicle routing problem
- The selective travelling salesman problem
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
- The stochastic vehicle routing problem revisited
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- The traveling salesman problem on a graph and some related integer polyhedra
- The traveling salesman problem with backhauls
- The traveling salesman problem with cumulative costs
- The traveling salesman problem: An overview of exact and approximate algorithms
- The truck dispatching problem
- The vehicle routing problem with backhauls
- The vehicle routing problem: An overview of exact and approximate algorithms
- Tight integral duality gap in the Chinese postman problem
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Time‐dependent traveling salesman problem–the deliveryman case
- Transforming arc routing into node routing problems
- Traveling salesman problem and local search
- Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
- Use of a fuzzy theory technique for grouping of trips in the vehicle routing and scheduling problem
- Using simulated annealing to solve routing and location problems
- Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows
- Vehicle Fleet Composition
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
- Vehicle Routing with Time Windows
- Vehicle routing considerations in distribution system design
- Vehicle routing via column generation
- Vehicle routing with full loads
- Vehicle routing with split deliveries
- Vehicle routing with stochastic demands and restricted failures
- Vehicles scheduling with sliding time windows
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- k-interchange procedures for local search in a precedence-constrained routing problem
Cited in
(56)- 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
- Heuristics for a cash-collection routing problem with a cluster-first route-second approach
- Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator
- Solving a fuel delivery problem by heuristic and exact approaches.
- Ship scheduling with soft time windows: An optimisation based approach
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands
- scientific article; zbMATH DE number 3896656 (Why is no real title available?)
- Creating very large scale neighborhoods out of smaller ones by compounding moves
- Real-time split-delivery pickup and delivery time window problems with transfers
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- Comparing descent heuristics and metaheuristics for the vehicle routing problem
- Formulations and valid inequalities for the heterogeneous vehicle routing problem
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- Steiner diagrams and \(k\)-star hubs
- Visiting a network of services with time constraints.
- Metaheuristics: A bibliography
- The periodic vehicle routing problem with intermediate facilities
- Multi-depot vessel routing problem in a direction dependent wavefield
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- Routing and scheduling field service operation by P-graph
- Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Synchronized routing of seasonal products through a production/distribution network
- ARMS: an automated resource management system for British telecommunications plc
- Proper balance between search towards and along Pareto front: biobjective TSP case study
- A metaheuristic algorithm to transporter scheduling for assembly blocks in a shipyard considering precedence and cooperating constraints
- Stochastic single vehicle routing problem with delivery and Pick up and a predefined customer sequence
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A genetic algorithm for the vehicle routing problem
- Stochastic vehicle routing
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles
- Extensions to the generalised assignment heuristic for vehicle routing
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- scientific article; zbMATH DE number 3848940 (Why is no real title available?)
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Vyacheslav Tanaev: contributions to scheduling and related areas
- UAV routing by simulation-based optimization approaches for forest fire risk mitigation
- Challenges and Advances in A Priori Routing
- New mathematical models of the generalized vehicle routing problem and extensions
- Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem
- Self-organizing feature maps for the vehicle routing problem with backhauls
- On Eulerian extensions and their application to no-wait flowshop scheduling
- 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
- AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS
- Modelling vehicle routing in GIS
- An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy
- Applying the attribute based hill climber heuristic to the 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
- scientific article; zbMATH DE number 3912105 (Why is no real title available?)
- A visual interactive approach to vehicle routing
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)
