Back to search

Routing and scheduling of vehicles and crews

Data up to Jan 2025

Published1983
Citations849
References479

Total Citations Per Year

Abstract

References (479)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Optimization by Simulated Annealing

1983 • 42,775 citations

A note on two problems in connexion with graphs

1959 • 22,492 citations

Dynamic Programming

1957 • 13,549 citations

Graph theory

1969 • 11,244 citations

Reducibility among Combinatorial Problems

1972 • 10,743 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Linear Programming and Extensions

1963 • 5,853 citations

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

1979 • 5,548 citations

An Efficient Heuristic Procedure for Partitioning Graphs

1970 • 5,215 citations

On the shortest spanning subtree of a graph and the traveling salesman problem

1956 • 4,806 citations

The Truck Dispatching Problem

1959 • 4,423 citations

An analysis of approximations for maximizing submodular set functions—I

1978 • 4,300 citations

Flows in networks

1962 • 4,199 citations

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

1973 • 3,730 citations

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

1964 • 3,673 citations

Introduction to Database Systems

2006 • 3,662 citations

Partitioning procedures for solving mixed-variables programming problems

1962 • 3,587 citations

Integer programming

1972 • 3,508 citations

Combinatorial optimization: networks and matroids

2021 • 3,410 citations

Complexity of Computer Computations

1972 • 2,804 citations

On a routing problem

1958 • 2,601 citations

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

1972 • 2,450 citations

Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

1964 • 2,305 citations

Approximation algorithms for combinatorial problems

1974 • 2,224 citations

Paths, Trees, and Flowers

1965 • 2,165 citations

Theory of scheduling

1967 • 2,160 citations

The Lagrangian Relaxation Method for Solving Integer Programming Problems

1981 • 2,035 citations

Computer Solutions of the Traveling Salesman Problem

1965 • 1,952 citations

Integer Programming Formulation of Traveling Salesman Problems

1960 • 1,787 citations

The Location of Emergency Service Facilities

1971 • 1,751 citations

Studies in the Economics of Transportation.

1956 • 1,717 citations

Paths, Trees, and Flowers

2009 • 1,627 citations

A Method for Solving Traveling-Salesman Problems

1958 • 1,449 citations

The Traveling-Salesman Problem and Minimum Spanning Trees

1970 • 1,431 citations

Validation of subgradient optimization

1974 • 1,360 citations

Solution of a Large-Scale Traveling-Salesman Problem

2009 • 1,314 citations

Optimization Theory for Large Systems

1970 • 1,265 citations

Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

1963 • 1,255 citations

A Dynamic Programming Approach to Sequencing Problems

1962 • 1,212 citations

Complexity of vehicle routing and scheduling problems

1981 • 1,194 citations

Solution of a Large-Scale Traveling-Salesman Problem

1954 • 1,141 citations

A Heuristic Algorithm for the Vehicle-Dispatch Problem

1974 • 1,137 citations

Optimization Theory of Large Systems

1971 • 1,129 citations

Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems

1965 • 1,092 citations

Lagrangean relaxation for integer programming

1974 • 1,056 citations

A generalized assignment heuristic for vehicle routing

1981 • 1,053 citations

An Algorithm for the Traveling Salesman Problem

1963 • 1,029 citations

The traveling-salesman problem and minimum spanning trees: Part II

1971 • 1,010 citations

Linear Programming and Extensions.

1964 • 1,008 citations

An Appraisal of Some Shortest-Path Algorithms

1969 • 999 citations

Lagrangian Relaxation for Integer Programming

2009 • 996 citations

Multicommodity Distribution System Design by Benders Decomposition * † ‡

2010 • 993 citations

Matching, Euler tours and the Chinese postman

1973 • 979 citations

Combinatorial Algorithms

2016 • 955 citations

Graph Theory: An Algorithmic Approach

1976 • 938 citations

The shortest path through many points

1959 • 933 citations

Multicommodity Distribution System Design by Benders Decomposition

1974 • 863 citations

Central Facilities Location

1970 • 828 citations

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

1977 • 807 citations

An analysis of several heuristics for the traveling salesman problem

2009 • 791 citations

Dynamic Programming Treatment of the Travelling Salesman Problem

1962 • 763 citations

Graph Theory: An Algorithmic Approach

1976 • 757 citations

Elements of the Theory of Computation

1981 • 753 citations

A Heuristic Program for Locating Warehouses

1976 • 745 citations

An Analysis of Several Heuristics for the Traveling Salesman Problem

1977 • 741 citations

The Euclidean travelling salesman problem is NP-complete

1977 • 738 citations

Urban operations research

1982 • 731 citations

Convex hulls of finite sets of points in two and three dimensions

1977 • 701 citations

On the Computational Complexity of Combinatorial Problems

1975 • 683 citations

An Algorithm for the Vehicle-dispatching Problem

1969 • 667 citations

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria

1981 • 661 citations

The Traveling-Salesman Problem

1956 • 621 citations

A Heuristic Program for Locating Warehouses

1963 • 606 citations

Vehicle Routing Problem

2017 • 582 citations

Combinatorial Optimization

1980 • 570 citations

Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

1964 • 551 citations

A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem

1980 • 550 citations

Capacitated arc routing problems

1981 • 547 citations

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

1981 • 510 citations

Transportation and traffic theory

1992 • 505 citations

Algorithms for network programming

1980 • 503 citations

Algorithm 232 : HEAPSORT

1964 • 495 citations

The fleet size and mix vehicle routing problem

1984 • 490 citations

Combinatorial Optimization with Rational Objective Functions

1979 • 477 citations

Networks and vehicle routing for municipal waste collection

1974 • 475 citations

Introduction to Database Systems

2022 • 474 citations

Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”

1979 • 452 citations

Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane

1977 • 447 citations

Set Partitioning: A survey

1976 • 444 citations

Approximation Algorithms for Some Routing Problems

1978 • 427 citations

A Branch-Bound Algorithm for Plant Location

1966 • 422 citations

Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking

1967 • 417 citations

A Combined Vehicle Routing and Inventory Allocation Problem

1984 • 409 citations

Some NP-complete geometric problems

1976 • 400 citations

The Traveling Salesman Problem: A Survey

1968 • 389 citations

Sparse Matrix Computations

1976 • 386 citations

The Traveling Salesman Problem: A Survey

1976 • 381 citations

Algorithm 360: shortest-path forest with topological ordering [H]

1969 • 374 citations

On an Integer Program for a Delivery Problem

1964 • 347 citations

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

1976 • 340 citations

The period routing problem

1984 • 335 citations

Classification in vehicle routing and scheduling

1981 • 329 citations

Implementing vehicle routing algorithms

1977 • 326 citations

Elements of the theory of computation

1982 • 321 citations

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

1981 • 321 citations

An Analysis of Private and Public Sector Location Models

1970 • 309 citations

Models for rail transportation

1980 • 305 citations

Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality

1980 • 301 citations

Computational experiments with algorithms for a class of routing problems

1983 • 300 citations

Minimizing the number of tankers to meet a fixed schedule

1954 • 292 citations

Computational Complexity of Discrete Optimization Problems

1979 • 292 citations

Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

1980 • 291 citations

Combinatorial algorithms

1976 • 288 citations

The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

1978 • 286 citations

Algorithms for Network Programming

1981 • 285 citations

Approximate Traveling Salesman Algorithms

1980 • 282 citations

Stochastic vehicle routing: A comprehensive approach

1983 • 267 citations

An Out-of-Kilter Method for Minimal-Cost Flow Problems

1961 • 267 citations

Topological design of centralized computer networks—formulations and algorithms

1982 • 263 citations

On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem

1982 • 261 citations

A fundamental problem in vehicle routing

1974 • 259 citations

Some Simple Applications of the Travelling Salesman Problem

1975 • 258 citations

Mathematics of the decision sciences

1968 • 255 citations

Finite Graphs and Networks, An Introduction with Applications

1967 • 254 citations

On general routing problems

1976 • 243 citations

Algorithm 245: Treesort

1964 • 243 citations

Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points

1972 • 239 citations

Programming, Games and Transportation Networks.

1967 • 237 citations

The Multiple Terminal Delivery Problem with Probabilistic Demands

1969 • 236 citations

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

1980 • 233 citations

A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

1979 • 227 citations

Bases for Vehicle Fleet Scheduling

1967 • 227 citations

On the Shortest Route Through a Network

1960 • 224 citations

Matching, a well solved class of integer linear programs

1970 • 216 citations

Implementation and efficiency of Moore-algorithms for the shortest route problem

1974 • 214 citations

The Design of Minimum-Cost Survivable Networks

1969 • 213 citations

On the symmetric travelling salesman problem I: Inequalities

1979 • 212 citations

An Integer Programming Approach to the Vehicle Scheduling Problem

1976 • 211 citations

A Heuristic Approach to Solving Travelling Salesman Problems

1964 • 207 citations

Shortest-Route Methods: 1. Reaching, Pruning, and Buckets

1979 • 203 citations

Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms

1977 • 200 citations

Design and Implementation of Large-Scale Primal Transshipment Algorithms

1976 • 196 citations

A branch‐bound algorithm for the capacitated facilities location problem

1969 • 182 citations

The complexity of the capacitated tree problem

1978 • 180 citations

Approximation Algorithms for Some Postman Problems

1979 • 180 citations

The Allocation of Aircraft to Routes—An Example of Linear Programming Under Uncertain Demand

1956 • 180 citations

The Set-Partitioning Problem: Set Covering with Equality Constraints

1969 • 178 citations

A Survey of Lagrangean Techniques for Discrete Optimization

1979 • 177 citations

The clustered traveling salesman problem

1975 • 174 citations

A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem

1979 • 173 citations

The complexity of restricted spanning tree problems

1982 • 172 citations

Routing and Scheduling of School Buses by Computer

1979 • 172 citations

The Airline Crew Scheduling Problem: A Survey

1969 • 170 citations

A primal algorithm for optimum matching

1978 • 169 citations

The Travelling Salesman Problem and Related Problems

1978 • 168 citations

Cyclic Scheduling via Integer Programs with Circular Ones

1980 • 168 citations

An exact algorithm for minimizing routing and operating costs in depot location

1981 • 168 citations

An approximate analytic model of many-to-many demand responsive transportation systems

1978 • 168 citations

On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem

1959 • 168 citations

Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem

1980 • 168 citations

Formulation and structure of more complex/realistic routing and scheduling problems

1981 • 167 citations

The Operator-Scheduling Problem: A Network-Flow Approach

1974 • 166 citations

On the complexity of edge traversing

1976 • 165 citations

Graphs and Their Uses

1963 • 164 citations

Multi-terminal vehicle-dispatch algorithm

1976 • 163 citations

The knapsack problem: A survey

1975 • 163 citations

The Loading Problem

1971 • 162 citations

A Sequential Route-building Algorithm Employing a Generalised Savings Criterion

1976 • 160 citations

A Computational Modification to the Savings Method of Vehicle Scheduling

1970 • 160 citations

Combinatorial optimization and vehicle fleet planning: Perspectives and prospects

1981 • 158 citations

Time‐minimizing transportation problems

1969 • 158 citations

Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

1983 • 158 citations

The alternating basis algorithm for assignment problems

1977 • 158 citations

On the symmetric travelling salesman problem II: Lifting theorems and facets

1979 • 157 citations

Edmonds polytopes and weakly hamiltonian graphs

1973 • 155 citations

On algorithms for finding the k shortest paths in a network

1979 • 153 citations

An assignment routing problem

1979 • 152 citations

Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problems

1974 • 152 citations

Real-Time Dispatch of Petroleum Tank Trucks

1981 • 152 citations

On the symmetric travelling salesman problem: A computational study

1980 • 151 citations

Scheduling Dial-a-Ride Transportation Systems

1978 • 150 citations

Combinatorial Optimization

2013 • 148 citations

A restricted Lagrangean approach to the traveling salesman problem

1981 • 145 citations

Algorithms and Complexity

2021 • 144 citations

Set partitioning based heuristics for interactive routing

1981 • 142 citations

A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering

1981 • 141 citations

Finding minimum rectilinear distance paths in the presence of barriers

1981 • 141 citations

A man-machine approach toward solving the traveling salesman problem

1971 • 140 citations

Design of school bus routes by computer

1969 • 139 citations

Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

1974 • 138 citations

Deficit Function Bus Scheduling with Deadheading Trip Insertions for Fleet Size Reduction

1981 • 136 citations

Rapid Transit Interstation Spacings for Minimum Travel Time

1968 • 135 citations

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

1983 • 135 citations

Computer-Assisted School Bus Scheduling

1972 • 134 citations

Scheduling and Fleet Routing Models for Transportation Systems

1971 • 133 citations

The vehicle routing problem

1976 • 132 citations

A Cutting Planes Algorithm for the m-Salesmen Problem

1980 • 132 citations

PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION

1983 • 132 citations

Pathology of Traveling-Salesman Subtour-Elimination Algorithms

1971 • 130 citations

A tutorial on heuristic methods

1980 • 130 citations

A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles

1983 • 129 citations

Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications

1981 • 128 citations

Computational Experience with an M-Salesman Traveling Salesman Algorithm

1973 • 127 citations

Worst-Case Analysis of Heuristic Algorithms

1980 • 127 citations

A model for the blocking of trains

1980 • 124 citations

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

1977 • 122 citations

General Techniques for Combinatorial Approximation

1977 • 120 citations

Networks and Basic Solutions

1966 • 120 citations

The optimum traversal of a graph

1973 • 119 citations

Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

1980 • 117 citations

A network algorithm for empty freight car allocation

1969 • 116 citations

An Asymptotic, Probabilistic Analysis of a Routing Problem

1978 • 115 citations

Programming, Games and Transportation Networks

1966 • 114 citations

Expected Distances in Distribution Problems

1969 • 113 citations

Leonhard Euler and the Koenigsberg Bridges

1953 • 113 citations

Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements

1974 • 112 citations

Combinatorial Programming: Methods and Applications

1976 • 112 citations

Local Search for the Asymmetric Traveling Salesman Problem

1980 • 109 citations

Applications of Linear Programming in the Oil Industry

1957 • 108 citations

On the Complexity of Local Search for the Traveling Salesman Problem

1977 • 106 citations

Deterministic network optimization: A bibliography

1977 • 104 citations

An improved version of the out-of-kilter method and a comparative study of computer codes

1974 • 103 citations

Technical Note—Shortest-Path Algorithms: A Comparison

1976 • 103 citations

Using cutting planes to solve the symmetric Travelling Salesman problem

1978 • 102 citations

Finite Graphs and Networks, An Introduction with Applications.

1967 • 102 citations

Interval estimation of a global optimum for large combinatorial problems

1979 • 101 citations

Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling

1982 • 100 citations

Two generalizations of the traveling salesman problem

1981 • 100 citations

The Engine Scheduling Problem In A Railway Network

1976 • 100 citations

Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems

1968 • 99 citations

On the symmetric travelling salesman problem: Solution of a 120-city problem

1980 • 99 citations

A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling

1973 • 98 citations

The adjacency relation on the traveling salesman polytope is NP-Complete

1978 • 97 citations

A Computer-Assisted System for the Routing and Scheduling of Street Sweepers

1978 • 97 citations

Iterative methods for determining the k shortest paths in a network

1976 • 96 citations

Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem

1983 • 95 citations

Optimal Parameters for a Coordinated Rail and Bus Transit System

1977 • 95 citations

Studies in operations management

1979 • 95 citations

Minimal Resources for Fixed and Variable Job Schedules

1978 • 95 citations

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

1983 • 94 citations

Shortest-Path Algorithms: A Comparison

1975 • 94 citations

Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling

1982 • 94 citations

An Algorithm for Large Set Partitioning Problems

1974 • 93 citations

Augmented Threaded Index Method For Network Optimization

1974 • 92 citations

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

1979 • 90 citations

The Chinese Postman Problem for Mixed Networks

1979 • 90 citations

Algorithms for Large-scale Travelling Salesman Problems

1972 • 89 citations

Integer programming approaches to the travelling salesman problem

1976 • 88 citations

Routing electric meter readers

1979 • 88 citations

An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem

1972 • 86 citations

Scheduling School Buses

1984 • 85 citations

A multi-level bottleneck assignment approach to the bus drivers' rostering problem

1984 • 83 citations

Some Examples of Difficult Traveling Salesman Problems

1978 • 83 citations

A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem

1978 • 82 citations

Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem

1974 • 82 citations

The Capacitated Minimum Spanning Tree

1973 • 82 citations

Route Constrained Fleet Scheduling

1976 • 81 citations

An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions

1977 • 79 citations

An approach for solving a class of transportation scheduling problems

1979 • 76 citations

Constructive Duality in Integer Programming

1974 • 74 citations

Bus routing in a multi-school system

1974 • 73 citations

Computing minimum spanning trees efficiently

1972 • 72 citations

Optimal Scheduiing of Two Consecutive Idle Periods

1972 • 70 citations

A shortest augmenting path method for solving minimal perfect matching problems

1981 • 70 citations

Procedures for travelling salesman problems with additional constraints

1979 • 70 citations

On obtaining the ‘best’ multipliers for a lagrangean relaxation for integer programming

1978 • 70 citations

Constructing an Optimal Fleet for a Transportation Schedule

1977 • 69 citations

Minimum Convex Cost Dynamic Network Flows

1984 • 69 citations

School bus routing by computer

1972 • 67 citations

A SIMULATION AND STATISTICAL ANALYSIS OF STOCHASTIC VEHICLE ROUTING WITH TIMING CONSTRAINTS

1978 • 66 citations

Generalized Linear Programming Solves the Dual

1976 • 64 citations

A statistical approach to the tsp

1977 • 64 citations

An Optimization Approach to Routing Aircraft

1976 • 61 citations

Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems

1977 • 59 citations

School bus routes generator in urban surroundings

1980 • 59 citations

A Framework For Probabilistic Vehicle Routing

1979 • 57 citations

A parallel insert method for the capacitated arc routing problem

1984 • 57 citations

Heuristic Programming as an Aid to Network Design

1975 • 56 citations

An augmenting path method for solving Linear Bottleneck Assignment problems

1978 • 56 citations

A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem

1980 • 56 citations

Technical Note—Bounds for the Travelling-Salesman Problem

1972 • 55 citations

The Bottleneck Traveling Salesman Problem

1978 • 54 citations

Tight bounds for christofides' traveling salesman heuristic

1978 • 54 citations

Computing capacitated minimal spanning trees efficiently

1974 • 54 citations

Efficient Heuristic Solutions to an Airline Crew Scheduling Problem

1979 • 54 citations

An Algorithm for Bus Scheduling Problems

1970 • 54 citations

A taxonomic structure for vehicle routing and scheduling problems

1975 • 53 citations

Vehicle Scheduling with Timed and Connected Calls: A Case Study

1968 • 53 citations

A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation

1977 • 53 citations

A Man-Machine Approach Toward Solving the Generalized Truck-Dispatching Problem

1972 • 52 citations

Technical Note—A Note on the Multiple Traveling Salesmen Problem

1980 • 52 citations

Crew Planning at Flying Tiger: A Successful Application of Integer Programming

1979 • 51 citations

Complexity of Combinatorial Algorithms

1978 • 51 citations

Geometric Approaches to Solving the Traveling Salesman Problem

1977 • 51 citations

Routing a fleet of M vehicles to/from a central facility

1974 • 50 citations

Computational Performance of Three Subtour Elimination Algorithms for Solving Asymmetric Traveling Salesman Problems

1977 • 47 citations

Testing of a large-scale network optimization program

1978 • 47 citations

Computational Comparison of Eight Methods for the Maximum Network Flow Problem

1980 • 46 citations

On the Relation Between the Traveling-Salesman and the Longest-Path Problems

1962 • 46 citations

The Traveling Salesman Location Problem

1976 • 46 citations

A detailed description of a computer system for the routing and scheduling of street sweepers

1979 • 46 citations

A model for large-scale aircraft routing and scheduling problems

1980 • 46 citations

The traveling purchaser problem

2002 • 46 citations

Routing for Public Service Vehicles

1971 • 45 citations

A good algorithm for smallest spanning trees with a degree constraint

1978 • 45 citations

On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs

1977 • 45 citations

A Multivehicle Tanker Scheduling Problem

1971 • 44 citations

A Vehicle Scheduling Procedure Based Upon Savings and a Solution Perturbation Scheme

1976 • 43 citations

The Shortest Hamiltonian Chain of a Graph

1970 • 42 citations

Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets

1982 • 42 citations

Rotating Roster for a Transit System

1968 • 41 citations

The Vehicle Scheduling Problem and Monte Carlo Simulation

1979 • 40 citations

Making Better Use of Optimization Capability in Distribution System Planning

1979 • 40 citations

Data Structures and Computer Science Techniques in Operations Research

1978 • 39 citations

Models for Public Systems Analysis

1977 • 39 citations

Transportation Routing Problem—A Survey

1974 • 39 citations

The design and analysis of heuristics

1981 • 38 citations

An algorithm for the minimum number of transport units to maintain a fixed schedule

1957 • 38 citations

Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”

1976 • 38 citations

On the solutions of stochastic traveling salesman problems

1978 • 38 citations

Adapting the savings algorithm for varying inter-customer travel times

1981 • 37 citations

TRAMP—A Multi-depot Vehicle Scheduling System

1972 • 37 citations

Randomized Pattern Search

1972 • 37 citations

Shortest paths with euclidean distances: An explanatory model

1978 • 37 citations

A solvable case of the traveling salesman problem

1971 • 37 citations

Combinatorial Optimization: What is the State of the Art

1980 • 37 citations

Travelling Salesman and Assignment Problems: A Survey

1979 • 36 citations

Construction of School Timetables by Flow Methods

1971 • 36 citations

On a Production Allocation and Distribution Problem

1978 • 36 citations

The traveling salesman problem: An update of research

1983 • 35 citations

A characterization of linear admissible transformations for the m-travelling salesmen problem

1979 • 34 citations

A Strongly Convergent Primal Simplex Algorithm for Generalized Networks

1979 • 34 citations

Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges

1977 • 34 citations

Assigning buses to schedules in a metropolitan area

1978 • 34 citations

Scheduling and routing models for airline systems

1969 • 34 citations

Computerized scheduling of seagoing tankers

1974 • 34 citations

On some combinatorial problems arising in scheduling

1970 • 34 citations

Heuristic Algorithm for the Traveling-salesman Problem

1969 • 33 citations

Computational results for very large air crew scheduling problems

1981 • 33 citations

A Lagrangean relaxation heuristic for vehicle routing

1984 • 32 citations

Direct search algorithms for truck-dispatching problems

1969 • 32 citations

The single vehicle many-to-many routing and scheduling problem

1981 • 31 citations

A study of a look-ahead procedure for solving the multiterminal delivery problem

1971 • 31 citations

Analytical Models In Rail Transportation: An Annotated Bibliography

1981 • 31 citations

Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

1973 • 30 citations

Timetables for a Suburban Rail Transit System

1969 • 30 citations

A NOTE ON THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM WITH FIXED CHARGES.

1977 • 30 citations

A note on determining operating strategies for probabilistic vehicle routing

1980 • 30 citations

A Survey of Local Delivery Vehicle Routing Methodology

1979 • 29 citations

A Note on Computational Simplifications in Solving Generalized Transportation Problems

1973 • 28 citations

Scheduling Local and Express Service

1969 • 28 citations

An Industrial application of the traveling salesman's subtour problem

1978 • 27 citations

Controlling left and u-turns in the routing of refuse collection vehicles

1982 • 27 citations

Public sector vehicle routing : the Chinese postman problem.

1970 • 26 citations

An extension of Christofides heuristic to the k-person travelling salesman problem

1983 • 26 citations

An Engineering Approach to the Traveling Salesman Problem

1966 • 26 citations

Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem

1980 • 26 citations

Current and future research directions in network optimization

1981 • 25 citations

A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One

1982 • 25 citations

Efficient special case algorithms for the n‐line planar traveling salesman problem

1980 • 25 citations

Evaluating a Sequential Vehicle Routing Algorithm

1977 • 24 citations

Worst case analysis of a class of set covering heuristics

1982 • 24 citations

Vehicle Scheduling — A Case Study

1972 • 24 citations

Spanning tree manipulation and the travelling salesman problem

1968 • 23 citations

On the Monotone Symmetric Travelling Salesman Problem: Hypohamiltonian/Hypotraceable Graphs and Facets

1980 • 23 citations

Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities

1971 • 23 citations

A Planning System for Facilities and Resources in Distribution Networks

1979 • 23 citations

On general routing problems: Comments

1976 • 23 citations

Optimal Routing of Refuse Collection Vehicles

1970 • 23 citations

Fleet Selection for Public Transportation Routes

1971 • 22 citations

Point estimation of a global optimum for large combinatorial problems

1978 • 22 citations

Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph

1981 • 22 citations

An Algorithm for Combining Truck Trips

1974 • 22 citations

Shortest Path and Network Flow Algorithms

1979 • 21 citations

A multi-period truck delivery problem

1967 • 21 citations

Surveillance of multi‐component systems: A stochastic traveling salesman's problem

1966 • 21 citations

Airline crew scheduling : a group theoretic approach

1969 • 21 citations

An Optimal Procedure for Allocating Manpower with Cyclic Requirements

1973 • 21 citations

TRANSPORTATION PLANNING: NETWORK MODELS AND THEIR IMPLEMENTATION

1978 • 20 citations

Scheduling Aircraft Cleaning Crews

1980 • 20 citations

Some fleet routing and scheduling problems for air transportation systems

1969 • 19 citations

Graphentheorie in Planungs- und Tourenproblemen

1970 • 19 citations

Relative Performance of Some Sequential Methods of Planning Multiple Delivery Journeys

1972 • 19 citations

New algorithms for deterministic and stochastic vehicle routing problems

1981 • 18 citations

A REVIEW OF HEURISTIC PROGRAMMING

1972 • 17 citations

The traveling salesman problem: A duality approach

1977 • 17 citations

A GENERAL REVIEW OF THE USE OF COMPUTERS IN SCHEDULING BUSES AND THEIR CREWS

1980 • 17 citations

The Theory of Networks and Management Science: Part II

1970 • 17 citations

Part II ‐ Generalization and analysis

1957 • 16 citations

The generalized alternating path algorithm for transportation problems

1978 • 16 citations

Nonlinear Programming Model of Crew Assignments for Household Refuse Collection

1971 • 16 citations

ALGORITHM FOR TRANSPORTATION ROUTING AND VEHICLE LOADING

1975 • 16 citations

OPTIMIZATION FOR SPARSE SYSTEMS

1976 • 16 citations

The Travelling Salesman Polytope and {0, 2}-Matchings

1982 • 15 citations

Heuristic programming applied to scheduling problems

1971 • 15 citations

The Konigsberg bridges problem generalized

1969 • 15 citations

The Minimum Fleetsize for a Suburban Railway System

1970 • 14 citations

Reduction and Solution of Large Scale Vehicle Routing Problems

1976 • 14 citations

Proportional rotating schedules

1969 • 14 citations

Optimal Cycles in Graphs and the Minimal Cost-To-Time Ratio Problem

1972 • 14 citations

MINIMUM FLEET SIZE MODELS FOR TRANSPORTATION SYSTEMS

1974 • 13 citations

A Time-of-Day Model for Aircraft Scheduling

1972 • 13 citations

A Branch-and-Bound Algorithm for Determining the Minimal Fleet Size of a Transportation System

1970 • 13 citations

Heuristic for the Asymmetric Travelling Salesman Problem

1978 • 13 citations

The Theory of Networks and Management Science. Part I

1970 • 13 citations

Garage Location for an Urban Mass Transit System

1984 • 12 citations

An Algorithm for the Space-Shuttle Scheduling Problem

1978 • 12 citations

Set Partitioning and Chain Decomposition

1974 • 12 citations

PREPARING DUTY ROSTERS FOR BUS ROUTES BY COMPUTER

1975 • 12 citations

A characterization of linear admissible transformations for the m-travelling salesmen problem: A result of Berenguer

1979 • 12 citations

THE DEVELOPMENT AND IMPLEMENTATION OF A HEURISTIC SET COVERING BASED SYSTEM FOR AIR CREW SCHEDULING

1985 • 12 citations

A mean‐time comparison of algorithms for the all‐pairs shortest‐path problem with arbitrary arc lengths

1978 • 12 citations

Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit

1980 • 11 citations

Commercial airline scheduling technique

1968 • 11 citations

Heuristic for the Hamiltonian Path Problem in Euclidian Two Space

1979 • 10 citations

Scheduling Boats to Sample Oil Wells in Lake Maracaibo

1978 • 10 citations

A new solvable case of the traveling salesman problem

1973 • 10 citations

The Hub Operation Scheduling Problem

1958 • 10 citations

Optimal dispatching strategies for vehicles having exponentially distributed trip times

1978 • 10 citations

CLUSTERING FOR ROUTING IN DENSE AREA

1981 • 9 citations

A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation

1980 • 9 citations

Scheduling a Fixed-Schedule, Common Carrier Passenger Transportation System

1970 • 9 citations

An improvement of Orloff's general routing problem

1977 • 9 citations

Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient

1973 • 9 citations

SCHEDULING ALGORITHMS FOR A DIAL-A-BUS SYSTEM

1971 • 9 citations

ESTIMATION OF THE OPERATING COST OF MASS TRANSIT SYSTEMS

1976 • 8 citations

Non-stop vs one stop flights

1977 • 8 citations

The Cost of Trucking: Econometric Analysis.

1966 • 8 citations

Automated pupil transportation

1974 • 8 citations

A rapid heuristic algorithm for the approximate solution of the traveling salesman problem

1975 • 8 citations

USES OF A VEHICLE ROUTING AND SCHEDULING SYSTEM IN STRATEGIC DISTRIBUTION PLANNING

1981 • 7 citations

A MATHEMATICAL MODEL FOR OPTIMIZING THE ASSIGNMENT OF MAN AND MACHINE IN PUBLIC TRANSIT RUN CUTTING

1966 • 7 citations

A Practical Method for Vehicle Scheduling

1979 • 7 citations

Scheduling of airline flight crews

1966 • 7 citations

A search algorithm for the traveling salesman problem

1978 • 7 citations

Some elements of the airline fleet planning problem

1977 • 6 citations

The “Hub” and “Wheel” Scheduling Problems

1977 • 6 citations

ALTERNATIVE TECHNIQUES FOR MODELING TRAVEL DISTANCE

1974 • 6 citations

Optimization Techniques

1971 • 6 citations

THE STATUS OF COMPUTER-AIDED SCHEDULING IN NORTH AMERICA

1980 • 6 citations

Bases for Vehicle Fleet Scheduling

1968 • 6 citations

Scheduling and estimation techniques for transportation planning

1981 • 6 citations

A network solution to a general vehicle scheduling problem

1977 • 6 citations

The Author's Reply—A Note on the Multiple Terminal Delivery Problem with Probabilistic Demands

1970 • 5 citations

Structuring and solving the bank messenger vehicle scheduling problem

1977 • 5 citations

Environmental inspection routes and the constrained travelling system salesman problem

1976 • 5 citations

A Boundary Method for Planar Travelling Salesman Problems

1968 • 5 citations

Using multidimensional scaling to solve traveling salesman and machine scheduling problems

1980 • 4 citations

A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges

1981 • 4 citations

Implementing operations research : a general strategy based on case studies

1974 • 4 citations

The Minimal Directed spanning Graph for Combinatorial Optimization.

1980 • 4 citations

Minimising the number of aircraft for a transportation network

1979 • 4 citations

Evaluation of some heuristic look ahead rules for multiple terminal delivery problems

1970 • 4 citations

Dynamic programming algorithms for specially structured sequencing and routing problems in transportation

1979 • 3 citations

A Computerized System for School Bus Routing.

1970 • 3 citations

A method for determination of optimum vehicle size and frequency of service for a short haul V/STOL air transport system

1968 • 3 citations

The Savings Method for Vehicle Scheduling

1973 • 3 citations

Resource allocation for transportation

1970 • 3 citations

The role of the systems department and the role of operations management in introducing computer assistance to bus scheduling.

1981 • 3 citations

Scheduling of Drivers for Mass Transit Systems Using Interactive Optimisation

1981 • 3 citations

Modern Methods for Local Delivery Route Design

1965 • 3 citations

Heuristic vehicle scheduling

1981 • 2 citations

A continuous variable representation of the traveling salesman problem

1978 • 2 citations

Interactive vehicle dispatching: a hybrid approach

1980 • 2 citations

HIERARCHICAL PROCEDURES FOR DETERMINING VEHICLE AND CREW REQUIREMENTS FOR MASS TRANSIT SYSTEMS

1980 • 2 citations

Large-scale vehicle routing and related combinatorial problems

1976 • 2 citations

Application Note ; Flight Itineraries Generator for an Airline with a Linear Network*

1977 • 2 citations

Crew scheduling on a transportation network

1966 • 2 citations

A note on heuristics for the traveling salesman problem

1980 • 2 citations

The fleet mix vehicle routing problem

1980 • 2 citations

Decomposition and Sensitivity Analysis in an Aircraft Tasking Problem

1977 • 2 citations

On the expected number of optimal and near-optimal solutions to the Euclidean travelling salesman problem

1981 • 2 citations

The urban postman problem

1982 • 2 citations

An Overview of Vehicular Scheduling Problems.

1974 • 1 citations

FEASIBILITY STUDY OF THE EMPLOYMENT CENTER BUS SERVICE CONCEPT

1976 • 1 citations

The Savings Method for Vehicle Scheduling — A Reply

1973 • 1 citations

Modern Methods for Local Delivery Route Design

1965 • 1 citations

Deleted Work

1955 • 0 citations

Cited By (0)

Loading...