Routing problems: A bibliography (Q1908308): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:02, 13 November 2024

scientific article

Language	Label	Description	Also known as
English	Routing problems: A bibliography	scientific article

Statements

scholarly article

0 references

Routing problems: A bibliography (English)

0 references

Gilbert Laporte

0 references

Ibrahim. H Osman

0 references

Annals of Operations Research

0 references

publication date

23 June 1996

0 references

zbMATH Keywords

traveling salesman

0 references

vehicle routing

0 references

Chinese postman

0 references

rural postman

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Integer linear programming formulation for a vehicle routing problem

0 references

The complexity of the travelling repairman problem

0 references

A set‐partitioning‐based exact algorithm for the vehicle routing problem

0 references

Heuristics for unequal weight delivery problems with a fixed error guarantee

0 references

Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees

0 references

Parallel Savings Based Heuristics for the Delivery Problem

0 references

Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories

0 references

A Class of Euclidean Routing Problems with General Route Cost Functions

0 references

A branch-and-cut algorithm for vehicle routing problems

0 references

Generating Travelling-Salesman Problems with Known Optimal Tours

0 references

0 references

The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases

0 references

A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows

0 references

Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

0 references

Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints

0 references

The prize collecting traveling salesman problem

0 references

Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space

0 references

An O(N log N) planar travelling salesman heuristic based on spacefilling curves

0 references

The stochastic vehicle routing problem revisited

0 references

0 references

A Model for Fleet Sizing and Vehicle Allocation

0 references

0 references

The capacitated arc routing problem: Valid inequalities and facets

0 references

Networks and vehicle routing for municipal waste collection

0 references

The Capacitated Arc Routing Problem: Lower bounds

0 references

Fast Algorithms for Geometric Traveling Salesman Problems

0 references

A Vehicle Routing Problem with Stochastic Demand

0 references

A Priori Optimization

0 references

A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane

0 references

Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles

0 references

Stochastic and dynamic vehicle routing with general demand and interarrival time distributions

0 references

Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming

0 references

The traveling salesman problem with cumulative costs

0 references

A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands

0 references

Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation

0 references

The arc partitioning problem

0 references

The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm

0 references

Vehicle routing considerations in distribution system design

0 references

The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem

0 references

Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands

0 references

Probabilistic Analysis of a Vehicle Routing Problem with Time Windows

0 references

Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

0 references

Integer linear programming formulation for vehicle routing problems

0 references

0 references

The Vehicle Scheduling Problem and Monte Carlo Simulation

0 references

Polyhedral results for a vehicle routing problem

0 references

A new heuristic for the traveling salesman problem

0 references

A branch and bound algorithm for the multiple depot vehicle scheduling problem

0 references

New lower bounds for the symmetric travelling salesman problem

0 references

A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions

0 references

A parallel insert method for the capacitated arc routing problem

0 references

Simulated annealing metaheuristics for the vehicle routing problem with time windows

0 references

An Integrated Inventory Allocation and Vehicle Routing Problem

0 references

0 references

The period routing problem

0 references

0 references

An algorithm for the Rural Postman problem on a directed graph

0 references

State-space relaxation procedures for the computation of bounds to routing problems

0 references

0 references

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

0 references

Traveling salesman problem and local search

0 references

A polyhedral approach to the rural postman problem

0 references

The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra

0 references

The traveling salesman problem on a graph and some related integer polyhedra

0 references

Polyhedral study of the capacitated vehicle routing problem

0 references

Multiobjective transportation network design and routing problems: Taxonomy and annotation

0 references

Modeling Distribution Problems with Time Windows: Part I

0 references

A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items

0 references

The Truck Dispatching Problem

0 references

Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem

0 references

A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints

0 references

Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case

0 references

A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

0 references

Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints

0 references

A classification scheme for vehicle routing and scheduling problems

0 references

0 references

A new heuristic for the fleet size and mix vehicle routing problem

0 references

A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows

0 references

Vehicle routing with full loads

0 references

Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows

0 references

Routing with time windows by column generation

0 references

Methods for routing with time windows

0 references

Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution

0 references

0 references

Vehicle routing with stochastic demands and restricted failures

0 references

Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks

0 references

Vehicle routing with split deliveries

0 references

A vehicle routing improvement algorithm comparison of a ''greedy'' and a matching implementation for inventory routing

0 references

Postman tour on a graph with precedence relation on arcs

0 references

Stochastic vehicle routing with modified savings algorithm

0 references

Savings by Split Delivery Routing

0 references

Split delivery routing

0 references

An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

0 references

The pickup and delivery problem with time windows

0 references

Matching, Euler tours and the Chinese postman

0 references

Routeing winter gritting vehicles

0 references

Arc Routing Problems, Part I: The Chinese Postman Problem

0 references

Arc Routing Problems, Part II: The Rural Postman Problem

0 references

Locational equilibrium of two facilities on a tree

0 references

Vehicle Fleet Composition

0 references

On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)

0 references

A Combined Vehicle Routing and Inventory Allocation Problem

0 references

Vehicles scheduling with sliding time windows

0 references

The Vehicle Scheduling Problem with Multiple Vehicle Types

0 references

A parallel tabu search algorithm for large traveling salesman problems

0 references

0 references

The Delivery Man Problem and Cumulative Matroids

0 references

An additive bounding procedure for the asymmetric travelling salesman problem

0 references

0 references

A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs

0 references

0 references

Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

0 references

A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing

0 references

A new class of cutting planes for the symmetric travelling salesman problem

0 references

Eulerian graphs and related topics. Part 1, Volume 1

0 references

Eulerian graphs and related topics. Part 1, Volume 2

0 references

Implementing an insertion heuristic for vehicle routing on parallel hardware

0 references

The <i>m</i>-Traveling Salesman Problem with Minmax Objective

0 references

Approximation Algorithms for Some Postman Problems

0 references

0 references

A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints

0 references

A Heuristic for the Periodic Vehicle Routing Problem

0 references

An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems

0 references

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

0 references

A Tabu Search Heuristic for the Vehicle Routing Problem

0 references

The traveling salesman problem with backhauls

0 references

A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers

0 references

An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers

0 references

Single-Vehicle Routing and Scheduling to Minimize the Number of Delays

0 references

A comparison of techniques for solving the fleet size and mix vehicle routing problem

0 references

A new heuristic for determining fleet size and composition

0 references

Ejection chains, reference structures and alternating path methods for traveling salesman problems

0 references

The vehicle routing problem with backhauls

0 references

0 references

The fleet size and mix vehicle routing problem

0 references

Microcomputer-based vehicle routing and scheduling software

0 references

The orienteering problem

0 references

Using simulated annealing to solve routing and location problems

0 references

0 references

Capacitated arc routing problems

0 references

Solution of large-scale symmetric travelling salesman problems

0 references

A cutting plane algorithm for the windy postman problem

0 references

On the windy postman problem

0 references

0 references

Eulerian Orientations and Circulations

0 references

Bounds and Heuristics for Capacitated Routing Problems

0 references

0 references

A Note on Bounds for Direct Shipping Cost

0 references

A heuristic solution to the warehouse location-routing problem

0 references

Les problèmes de tournées avec contraintes de fenêtres de temps, l'état de l'art

0 references

Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search

0 references

A Request Clustering Algorithm for Door-to-Door Handicapped Transportation

0 references

Covering Graphs by Simple Circuits

0 references

0 references

A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited

0 references

Bounds for the general capacitated routing problem

0 references

0 references

Provably good solutions for the traveling salesman problem

0 references

Use of a fuzzy theory technique for grouping of trips in the vehicle routing and scheduling problem

0 references

The mixed postman problem

0 references

Algorithms to solve the orienteering problem: A comparison

0 references

Tabu search performance on the symmetric travelling salesman problem

0 references

Vehicle Routing with Time Windows

0 references

A GRASP for the Vehicle Routing Problem with Time Windows

0 references

Entwicklung eines hybriden genetischen Algorithmus zur Tourenplanung

0 references

Tight integral duality gap in the Chinese postman problem

0 references

An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints

0 references

RANDOMIZED DECISION STRATEGY FOR THE HIERARCHICAL OPTIMIZATION PROBLEMS

0 references

THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM

0 references

Capacitated Vehicle Routing on Trees

0 references

Classification of travelling salesman problem formulations

0 references

Generalized Subtour Elimination Constraints and Connectivity Constraints

0 references

0 references

The traveling salesman problem: An overview of exact and approximate algorithms

0 references

The vehicle routing problem: An overview of exact and approximate algorithms

0 references

Dynamic Location-routeing Problems

0 references

0 references

The integer \(L\)-shaped method for stochastic integer programs with complete recourse

0 references

The Vehicle Routing Problem with Stochastic Travel Times

0 references

Models and exact solutions for a class of stochastic location-routing problems

0 references

A Priori Optimization of the Probabilistic Traveling Salesman Problem

0 references

The selective travelling salesman problem

0 references

Optimal tour planning with specified nodes

0 references

An exact algorithm for the asymmetrical capacitated vehicle routing problem

0 references

A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems

0 references

0 references

Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach

0 references

A branch and bound algorithm for the capacitated vehicle routing problem

0 references

0 references

Optimal Routing under Capacity and Distance Restrictions

0 references

Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems

0 references

A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem

0 references

0 references

Strong linear programming relaxations for the orienteering problem

0 references

0 references

Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems

0 references

On the Distance Constrained Vehicle Routing Problem

0 references

0 references

A new algorithm for the directed Chinese postman problem

0 references

Time‐dependent traveling salesman problem–the deliveryman case

0 references

A modified Lin--Kernighan traveling-salesman heuristic

0 references

Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

0 references

Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem

0 references

Quick updates for \(p\)-opt TSP heuristics

0 references

Large-step Markov chains for the TSP incorporating local search heuristics

0 references

A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems

0 references

Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem

0 references

The Chinese Postman Problem for Mixed Networks

0 references

An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint

0 references

Dynamic Optimization of Vehicle Fleet Size

0 references

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

0 references

The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities

0 references

Implementation techniques for the vehicle routing problem

0 references

An optimal algorithm for the mixed Chinese postman problem

0 references

A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem

0 references

An Efficient Transformation Of The Generalized Traveling Salesman Problem

0 references

Asymptotic expected performance of some TSP heuristics: An empirical evaluation

0 references

A fundamental problem in vehicle routing

0 references

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

0 references

Optimization of a 532-city symmetric traveling salesman problem by branch and cut

0 references

Facet identification for the symmetric traveling salesman polytope

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

An analytical comparison of different formulations of the travelling salesman problem

0 references

The savings algorithm for the vehicle routing problem

0 references

On the complexity of edge traversing

0 references

The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem

0 references

On a Fleet Sizing and Allocation Problem

0 references

Approximate solutions for the capacitated arc routing problem

0 references

Augment-insert algorithms for the capacitated arc routing problem

0 references

Transforming arc routing into node routing problems

0 references

Algorithms for the windy postman problem

0 references

A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

0 references

State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective

0 references

The Vehicle Routing Problem with Time Windows Part I: Tabu Search

0 references

ALTO: A computer system for the design of vehicle routing algorithms

0 references

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows

0 references

k-interchange procedures for local search in a precedence-constrained routing problem

0 references

Scheduling Large-Scale Advance-Request Dial-A-Ride Systems

0 references

Routing and Scheduling on a Shoreline with Release Times

0 references

A practical heuristic for a large scale vehicle routing problem

0 references

On the mixed Chinese postman problem

0 references

An Optimal Algorithm for the Orienteering Tour Problem

0 references

Fast Heuristics for Large Geometric Traveling Salesman Problems

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

An Improved Petal Heuristic for the Vehicle Routeing Problem

0 references

A tabu search heuristic for the multi-depot vehicle routing problem

0 references

A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem

0 references

A cubic algorithm for the directed Eulerian subgraph problem

0 references

On finding spanning eulerian subgraphs

0 references

Probabilistic exchange algorithms and Euclidean traveling salesman problems

0 references

The Capacitated Canadian Postman Problem

0 references

Hybrid Heuristics for the Vehicle Routing Problem with Time Windows

0 references

Technical Note—An Effective Heuristic for the <i>M</i>-Tour Traveling Salesman Problem with Some Side Conditions

0 references

A multiphase approach to the period routing problem

0 references

Extensions of the Petal Method for Vehicle Routeing

0 references

The effect of ignoring routes when locating depots

0 references

Incorporating vehicle into the vehicle routing fleet composition problem

0 references

An efficient implementation of local search algorithms for constrained routing problems

0 references

0 references

The General Pickup and Delivery Problem

0 references

Des opérateurs d'échange et une méthode de relaxation pour le problème du voyageur de commerce

0 references

Solving real-life vehicle routing problems efficiently using tabu search

0 references

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling

0 references

Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing

0 references

Pickup and Delivery of Partial Loads with “Soft” Time Windows

0 references

Hierarchical Planning for Probabilistic Distribution Systems in Euclidean Spaces

0 references

Vehicle routing via column generation

0 references

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

0 references

On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints

0 references

0 references

Survey Paper—Time Window Constrained Routing and Scheduling Problems

0 references

A Lagrangean relaxation heuristic for vehicle routing

0 references

Stochastic vehicle routing: A comprehensive approach

0 references

Scheduling School Buses

0 references

Parallel iterative search methods for vehicle routing problems

0 references

Algorithms for the Vehicle Routing Problems with Time Deadlines

0 references

Heuristic approaches to vehicle routing with backhauls and time windows

0 references

Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems

0 references

An Exact Algorithm for the Vehicle Routing Problem with Backhauls

0 references

Special cases of traveling salesman and repairman problems with time windows

0 references

The fleet size and mix problem for capacitated arc routing

0 references

0 references

Improvement heuristics for the vehicle routing problem based on simulated annealing

0 references

Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows

0 references

A bi-criteria heuristic for the vehicle routing problem with time windows

0 references

A Repeated Matching Heuristic for the Vehicle Routeing Problem

0 references

0 references

On the windy postman problem on Eulerian graphs

0 references

Heuristic methods and applications: A categorized survey

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/BF02098290

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

DBLP publication ID

journals/anor/LaporteO95

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1908308

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1908308&oldid=37908206"