Routing and scheduling of vehicles and crews. The state of the art

Computers and Operations Research

Volumn 10, Issue 2, 1983, Pages

  Raff, Samuel ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

TRANSPORTATION;

EID: 0020504118     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(83)90030-8     Document Type: Review

References (699)

1. An algorithm for transportation routing and vehicle loading
2. An analysis of various aspects of the traveling salesman problem
3. The minimal directed spanning graph for combinatorial optimization
4. On the expected number of optimal and near-optimal solutions to the Euclidean traveling salesman problem
5. The M-travelling salesman problem: a duality based branch and bound algorithm
6. A nonlinear programming model for household refuse collection
7. Computer Assisted School Bus Scheduling
8. Optimization of vehicle schedules for a road transit corporation
9. Vehicle Scheduling Program
10. The airline crew scheduling problem a survey
11. The “hub” and “wheel” scheduling problems
12. Decomposition and sensitivity analysis in an aircraft tasking problem
13. Optimal dispatching strategies for vehicles having exponentially distributed trip times
14. Analytic models in rail transportation: an annotated bibliography
15. Models for rail transportation
16. Modeling rail freight management
17. Combined distribution routing and scheduling in a large commercial firm
18. Design of an inventory/routing system for a large propane-distribution firm
19. Efficient heuristic solutions for the airline crew scheduling problem
20. An algorithm for vehicle routing with time window constraints
21. Efficient heuristic solutions to an airline crew scheduling problem
22. The development and implementation of a heuristic set covering based system for air crew scheduling
23. Computational results for very large air crew scheduling problems
24. An optimal procedure for allocating manpower with cyclic requirements
25. Scheduling a full-time workforce to meet cyclic staffing requirements
26. A new penalty method for the travelling salesman problem
27. A restricted Lagrangean approach to the travelling salesman problem
28. Set Covering Algorithms Using Cutting Planes Heuristics and Subgradient Optimization A Computational Study
29. Set partitioning a survey
30. On an integer program for a delivery problem
31. A comparison of relaxations and heuristics for certain crew and vehicle scheduling problems
32. Garage Location for an Urban Mass Transit System
33. A matching based heuristic for scheduling mass transit crews and vehicles
34. Experimentation with a computerized system for scheduling mass transit vehicles and crews
35. Scheduling of drivers for mass transit systems using interactive optimization
36. Planning for truck fleet size in the presence of a common carrier option
37. The design and analysis of heuristics
38. Graphical solution of the traveling-salesman problem
39. An improved version of the out-of-kilter method and a comparative study of computer codes
40. The alternating basis algorithm for assignment problems
41. The generalized alternating path algorithm for transportation problems
42. A guaranteed accuracy round-off algorithm for cyclic scheduling and set covering
43. Cyclic scheduling via integer programs with circular ones
44. An algorithm for the minimum number of transport units to maintain a fixed schedule
45. Cyclic scheduling and combinatorial topology assignment of routing and motive power to meet scheduling and maintenance requirements Part II Generalizations and analysis
46. The optimum routing for an air cargo carrier's mixed fleet
47. The traveling salesman: a duality approach
48. The shortest path through many points
49. Adapting the savings algorithm for varying inter-customer travel times
50. On a routing problem
51. Dynamic programming treatment of the traveling salesman problem
52. The Königsberg Bridges problem generalized
53. Dynamic programming treatment of the travelling salesman problem
54. A multivehicle tanker scheduling problem
55. Transformation of multi-salesman problem to the standard traveling salesman problem
56. Pathology of traveling-salesman subtour-elimination algorithms
57. The traveling salesman problem a survey
58. Networks and vehicle routing for municipal waste collection
59. Partitioning procedures for solving mixed variable programming problems
60. Optimization of bus crew rosters: an application of combinatorial mathematics
61. School bus routing by computer
62. Rotating roster for a transit system
63. Resource allocation for transportation
64. Overview of RUCUS vehicle scheduling program (BLOCKS)
65. An analysis of two heuristics for the Euclidean traveling salesman problem
66. A characterization of linear admissible transformations for theM-traveling salesman problem
67. Minimal Cost allocations of bus driving assignments between split runs and trippers
68. A heuristic approach to vehicle scheduling with due-date constraints
69. HASTUS: an evaluation model for drivers union negotiation in transit companies
70. HASTUS for Bus operator scheduling: the man-machine interface
71. A taxonomic structure for vehicle routing and scheduling problems
72. A transit operating cost model based on direct systems characteristics
73. Towards a general model for manpower scheduling—Parts 1 and 2
74. Routing and scheduling of school buses by computer
75. Hierarchical procedures for determining vehicle and crew requirements for mass transit systems
76. Scheduling of committees for the New York State Assembly
77. Classification in vehicle routing and scheduling
78. A model for the blocking of trains
79. A detailed description of a street sweeper routing and scheduling system
80. A computer-assisted system for the routing and scheduling of street sweepers
81. Approximation Techniques for automated Manpower Scheduling
82. Estimation of the operating cost of mass transit systems
83. Scheduling and estimation techniques for transportation planning
84. UCOST. A micro approach to a transit planning problem
85. The subscriber dial-a-ride problem: the Baltimore Maryland Benchmark
86. The subscriber dial-a-ride problem
87. The multi-vehicle subscriber dial-a-ride problem
88. Optimal routing of refuse collection vehicles
89. A crew planning and scheduling system
90. Crew scheduling by computer: a test on the possibility of designing duties for a certain busline
91. Itineraries generator for a linear network
92. Design and implementation of large scale primal transshipment algorithms
93. Bus scheduling program development for A.T.A.F. Florence
94. Real time dispatch of petroleum tank trucks
95. The traveling salesman location problem
96. Integer programming models of transportation systems: an airline system example
97. Traveling salesman and assignment problems: a survey
98. Assignment and matching problems: solution methods with FORTRAN programs
99. The vehicle scheduling problem and Monte Carlo simulation
100. The optimal use of truck fleets
101. Some new branching and bounding criteria for the asymmetric travelling salesman problem
102. A multilevel bottleneck assignment approach to the bus drivers' rostering problem
103. Decomposition approaches to large scale bus driver scheduling problems
104. TRAMP—a multi-depot vehicle scheduling system
105. Deficit function bus scheduling with deadheading trip insertions for fleet size reduction
106. The capacitated minimum spanning tree
107. TRANSCOL: un systéme de transport intégré
108. A parallel insert method for the capacitated arc routing problem
109. Clustering for routing in dense area
110. An example of an integrated man-machine system for truck scheduling
111. Computational comparison of eight methods for the maximum network flow problem
112. The clustered traveling salesman problem
113. The single vehicle many to many routing and scheduling problem with customer-dependent objective function coefficients
114. Edmonds' polytopes and weakly Hamiltonian graphs
115. The shortest Hamiltonian chain of a graph
116. Bounds for the traveling salesman problem
117. The optimum traversal of a graph
118. The vehicle routing problem
119. The vehicle routing problem
120. Worst-case analysis of a new heuristic for the traveling salesman problem
121. Trees, cacti, and the traveling salesman problem
122. The traveling salesman problem
123. Uses of a vehicle routing and scheduling system in strategic distribution planning
124. Expected distances in distribution problems
125. An algorithm for the vehicle dispatching problem
126. Algorithms for large-scale traveling salesman problems
127. A shortest path algorithm for generalized weighted matchings in graphs
128. The vehicle routing problem
129. Exact algorithms for the TSP with additional constraints
130. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
131. State space relaxation procedures for the computation of bounds to routing problems
132. Scheduling of vehicles from a central depot to a number of delivery points
133. A heuristic approach to some sales territory problems
134. A simulation and statistical analysis of stochastic vehicle routing with timing constraints
135. Location of bank accounts to optimize float an analytic study of exact and approximate algorithms
136. Tight bounds on Christofides' traveling salesman heuristic
137. The travelling salesman polytope and {0,2}-matchings
138. Le probleme des horaires d'equipage d'une compagnie d'aviation
139. A method for solving traveling salesman problems
140. Solving large-scale symmetric travelling salesman problems to optimality
141. Set partitioning based heuristics for interactive routing
142. A primal algorithm for optimum matching
143. Scheduling boats to sample oil wells in Lake Maracaibo
144. Efficient special case algorithms for the N-line planar travelling salesman problem
145. An approximate analytic model of many-to-many demand responsive transportation systems
146. On the shortest route through a network
147. Finding a cycle in a graph with minimum cost to time ratio with applications to a ship routing problem
148. Minimizing the number of tankers to meet a fixed schedule
149. Solution of a large-scale traveling salesman problem
150. On a linear programming combinatorial approach to the traveling salesman problem
151. The truck dispatching problem
152. A note on heuristics for the traveling salesman problem
153. On the delivery problem and some related topics
154. Service optimisation and route costing and associated computer programs
155. A branch-bound algorithm for the capacitated facilities location problem
156. Shortest-route methods 1 Reaching pruning and buckets
157. A shortest augmenting path method for solving minimal perfect matching problems
158. Another composite heuristic for solving Euclidean traveling salesman problems
159. Matching code theory Part I. Combinatorial structures and the cardinality matching problem
160. On two methods for solving minimal perfect matching problems
161. An augmenting path method for solving linear bottleneck assignment problems
162. Surveillance of multicomponent systems a stochastic traveling salesman's problem
163. A school busing system
164. Computational Study of the Symmetric assignment problem
165. On some combinatorial problems arising in scheduling
166. Construction of school timetables by flow methods
167. Scheduling an urban railway
168. Algorithm 360 shortest path forest with topological ordering
169. A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
170. The role of the systems department and the role of operations management in introducing computer assistance to bus scheduling
171. A note on two problems in connection with graphs
172. Environmental inspection routes and the constrained traveling salesman problem
173. A more compact formulation of the symmetric multiple traveling salesman problem with fixed charges
174. An appraisal of some shortest-path algorithms
175. School bus routes generator in urban surroundings
176. Paths trees and flowers
177. Matroid partition
178. Matching: a well-solved class of integer linear programs
179. Matching, Euler tours, and the Chinese postman
180. Theoretical improvements in algorithmic efficiency for network flow problems
181. A branch and bound algorithm for plant location
182. The loading problem
183. A strongly convergent primal algorithm for generalized networks
184. A mathematical model for optimizing the assignment of man and machine in public transit “run cutting”
185. The theory of networks and management science
186. The theory of networks and management science
187. The Konigsberg bridges
188. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources
189. A combined vehicle routing and inventory allocation problem
190. Solution Techniques for Stationary and Time Varying Traveling Salesman Problems
191. Controlling fixed-route operations
192. The allocation of aircraft to routes—an example of linear programming under uncertain demand
193. A sub-optimal algorithm to solve a large scale 0–1 programming problem
194. A simplex-type approach to solve the engine scheduling problem
195. A network model for bidline generation
196. Worst-case analysis of heuristic algorithms
197. The Lagrangian relaxation method for solving integer programming problems
198. An algorithm for the space-shuttle scheduling problem
199. A decomposition algorithm for large-scale vehicle routing
200. A generalized assignment heuristic for vehicle routing
201. The impact of advanced technologies in inventory management
202. An analysis of approximations for finding a maximum weight Hamiltonian circuit
203. Constructive duality in integer programming
204. The traveling salesman problem
205. The engine scheduling problem in a railway network
206. Algorithm 245 Treesort 3
207. An integer programming approach to the vehicle scheduling problem
208. Finding a minimal cost to time ratio circuit
209. Data structures and computer science techniques in operations research
210. An n-constraint formulation of the (time dependent) traveling salesman problem
211. Approximation algorithms for some postman problems
212. Approximation algorithms for some routing problems
213. Worst-case analysis of algorithms for travelling salesman problems
214. An extension of Christofides heuristic to the K-person travelling salesman problem
215. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
216. An out-of-kilter method for minimal cost flow problems
217. An overview of vehicular scheduling problems
218. An efficient implementation of Edmond's algorithm for maximum matching on graphs
219. A good algorithm for smallest spanning trees with a degree constraint
220. Some NP-complete geometric problems
221. On partitioning the feasible set in a branch-and-bound algorithm for the asymmetric traveling salesman problem
222. Minimizing wallpaper waste Part 1 A class of traveling salesman problems
223. The bottleneck traveling salesman problem algorithms and probabilistic analysis
224. Optimal set covering: a survey
225. The set partitioning problem set covering with equality constraints
226. Modelling and optimization for transportation systems planning and operations
227. Applications of vehicle routing in the oil industry
228. Bases for vehicle fleet scheduling
229. WMATA bus operating cost model
230. A note on the formulation of the M-salesman traveling salesman problem
231. On obtaining the ‘best’ multipliers for a Lagrangean relaxation for integer programming
232. Formulations and algorithms for the capacitated minimal directed tree problem
233. The travelling salesman problem and related problems
234. An algorithm for combining truck trips
235. Assigning buses to schedules in a metropolitan area
236. An Approach for solving a class of transportation scheduling problems
237. 2) Algorithms for sensitivity analysis of minimal spanning trees and related subgraphs
238. An optimal method for the multiple travelling salesman problem
239. An industrial application of the traveling salesman's subtour problem
240. Lagrangian relaxation for integer programming
241. A guide to computer-assisted methods for distribution system planning
242. Making better use of optimization capability in distribution systems planning
243. Multicommodity distribution system design by Benders decomposition
244. A new algorithm for very large crew pairing problems
245. Constructing an optimal fleet for a transportation schedule
246. Minimal resources for fixed and variable job schedules
247. A more compact transformation of the symmetric multiple traveling salesman problem with fixed charges
248. Multi-terminal vehicle-dispatch algorithm
249. A heuristic algorithm for the vehicle dispatch problem
250. Sequencing a one state-variable machine a solvable case of the traveling salesman problem
251. performance comparison of labeling algorithms for calculating shortest path trees
252. Finding an optimal edge-covering tour of a connected graph
253. Minimum complete matchings
254. Implementation and computational comparisons of primal, dual, and primal-dual computer codes for minimum cost network flow problems
255. A note on computational simplifications in solving generalized transportation problems
256. Finding minimum spanning trees with fixed number of links at a node
257. Augmented threaded index method for network optimization
258. Extensions of the augmented predecessor index method to generalized network problems
259. An examination of the run cutting and scheduling (RUCUS) system—a case analysis
260. Vehicle routing problems: formulations and heuristic solution techniques
261. Large scale vehicle routing and related combinatorial problems
262. Shortest path algorithms a comparison
263. Evaluating a sequential vehicle routing algorithm
264. Statistical Estimation for combinatorial decision problems
265. A statistical approach to the TSP
266. Recent developments in vehicle routing
267. Point estimation of a global optimum for large combinatorial problems
268. Interval estimation of a global optimum for large combinatorial problems
269. Listings and documentation for selected network optimization computer codes
270. The fleet size and mix vehicle routing problem
271. Shortest paths with Euclidean distances: an explanatory model
272. Current and future research directions in network optimization
273. Solving large distribution-routing problems efficiently
274. Network analysis
275. Solving large distribution-routing problems efficiently
276. Approximate traveling salesman algorithms
277. Computational experiments with algorithms for a class of routing problems
278. Two generalizations of the traveling salesman problem
279. Deterministic network optimization—a bibliography
280. Implementing vehicle routing algorithms
281. Vehicle routing with probabilistic demands
282. The empirical analysis of TSP heuristics
283. A curve-fitting experiment in estimating optimal solution values to traveling salesman problems
284. Capacitated arc routing problems
285. A framework of probabilistic vehicle routing
286. On the scheduling of railroad freight operations
287. Optimization and approximation in deterministic sequencing and scheduling: a survey
288. An optimization-based approach to vehicle routing
289. Scheduling and dispatching policies in transportation systems
290. On the symmetric traveling salesman problem solution of 120-city problem
291. On the monotone symmetric travelling salesman problem hypohamiltonian/hypotraceable graphs and facets
292. On the symmetric traveling salesman problem I inequalities
293. On the symmetric traveling salesman problem II Lifting theorems and facets
294. Optimal scheduling of tours and days off
295. A search algorithm for the traveling salesman problem
296. Optimum distribution of switching centers in a communication network and some related graph theoretic problems
297. Optimum location of switching centers and the absolute centers and medians of a graph
298. A fast algorithm for the Euclidean traveling salesman problem optimal with probability one
299. Time-minimizing transportation problems
300. Improvements of the held-karp algorithm for the symmetric traveling salesman problem
301. On the relation between the traveling salesman problem and the longest path problem
302. A planning system for facilities and resources in distribution networks
303. Computerized Scheduling of Sea-Going Tankers
304. A glossary of terms in bus and crew scheduling
305. Fleet selection for public transportation routes
306. A multi-period truck delivery problem
307. The delivery problem
308. A dynamic programming approach to sequencing problems
309. The traveling salesman problem and minimum spanning trees
310. The traveling salesman problem and minimum spanning trees Part II
311. Validation of subgradient optimization
312. A system for computer design of proportional rotating work schedules
313. Relationships between the scheduling of telephone operators and public transportation vehicle drivers
314. Evaluation of some heuristic look ahead rules for multiple terminal delivery problems
315. Preparing duty rosters for bus routes by computer
316. Advances in computer assisted runcutting in North America
317. Structuring and solving the bank messenger vehicle scheduling problem
318. Computer algorithm for messenger vehicle scheduling at Ohio National Bank
319. A comparison of human decision makers and a computer algorithm for the traveling salesman problem
320. RUCUS: a comparative status report and assessment
321. Improvements to the Clarke and Wright algorithm as applied to an airline scheduling problem
322. Worst case analysis of a class of set covering heuristics
323. Computerized vehicle and driver scheduling for the Hamburger Hochbahn Aktiengesellschaft
324. The school transportation problem
325. A vehicle scheduling procedure based upon savings and a solution perturbation scheme
326. A note on the symmetric multiple traveling salesman problem with fixed charges
327. The travelling salesman problem and shortest n-paths
328. Analysis models for solid waste collection
329. Commercial airline scheduling technique
330. Some comments on the traveling salesman problem
331. Integer linear programming as an aid in solving the airline crew schedule planning problem
332. Attendance and rostering system
333. A comparative study of methods for solving a real life two-level distribution problem
334. On the location of transfer points in a two-level newspaper delivery system—a case study
335. A heuristic algorithm for the multi vehicle many to many advanced request dial-a-ride problem, Version 2
336. An automated technique for scheduling motormen and conductors for the New York City Subways
337. Data-dependent bounds for heuristics to find a minimum weight Hamiltonian circuit
338. Approximate Algorithms for Combinatorial Problems
339. Networks and basic solutions
340. Bounding symmetric traveling salesman problems with an asymmetric assignment problem
341. Local search for the asymmetric traveling salesman problem
342. A preference order dynamic program for a stochastic traveling salesman problem
343. A heuristic approach to solving traveling salesman problems
344. A patching algorithm for the nonsymmetric traveling salesman problem
345. On the computational complexity of combinatorial problems
346. The probabilistic analysis of some combinatorial search algorithms
347. Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane
348. Reducibility among combinatorial problems
349. Verfahren zur Losung minimaler perfekter Matching-probleme mittels kurzester erweiternder Pfade
350. Improving productivity in physical distribution
351. Automating trip scheduling and optimal vehicle assignments
352. Practical considerations in developing effective manpower and equipment schedules
353. A mean-time comparison of algorithms for the all-pairs shortest path problem with arbitrary arc lengths
354. Computing capacitated minimal spanning trees efficiently
355. Computing minimum spanning trees efficiently
356. An efficient heuristic procedure for partitioning graphs
357. A minimal spanning tree and approximate tours for a traveling salesman
358. The savings method for vehicle scheduling
359. Optimization by simulated annealing
360. Combinatorial optimization: what is the state of the art?
361. The Tyagi algorithm for truck dispatching
362. Vehicle scheduling with timed and connected calls a case study
363. The use of a heuristic tree search algorithm for vehicle routing and scheduling
364. Bus crew scheduling at Helsinki City Transport
365. Automated formation of staff schedules and duty rosters
366. The method of ellipses (MOE): A Vehicle selection heuristic for the GRASP system
367. Three scheduling heuristics for 24 hour advance reservation paratransit systems
368. Efficient heuristics for solving large traveling salesman problems
369. A man-machine approach toward solving the traveling saleman problem
370. A man-machine approach toward solving the generalized truck dispatching problem
371. A family of truck load clustering heuristics for solving vehicle scheduling problems
372. On the shortest spanning subtree of a graph and the traveling salesman problem
373. A heuristic program for locating warehouses
374. Implementing operations research: a strategy based on case studies
375. Non-stop vs one stop flights
376. Customer service: meaning and measurement
377. Comments on a heuristic algorithm for the multiple terminal delivery problem
378. A perspective on automated bus operator scheduling: five years experience in Portland
379. A cutting planes algorithm for the m-saleman problem
380. Subtour elimination algorithms for the symmetrical traveling salesman problem and its variants
381. An exact algorithm for minimizing routing and operating costs in depot location
382. The multi-depot traveling salesman problem
383. Generalized traveling salesman problem through n sets of nodes: an integer programming approach
384. A dynamic programming approach to airline scheduling
385. Finding minimum rectilinear distance paths in the presence of barriers
386. A solvable case of the traveling salesman problem
387. Optimal cycles in graphs and the minimal cost-to-time ratio problem
388. Shortest path and network flow algorithms
389. Interactive vehicle dispatching: a Hybrid approach
390. Scheduling empty freight car fleets on the Louisville and Nashville Railroad
391. Graphen Theorie in Planungs-und Touren Problemen
392. On the solutions of stochastic traveling salesman problems
393. On general routing Problems
394. Some simple applications of the traveling salesman problem
395. Computational complexity of discrete optimization problems
396. A characterization of linear admissible transformations for the m-traveling salesman problem: a result of Berenguer
397. Complexity of vehicle routing and scheduling problems
398. Hastus I: a mathematical programming approach to the bus driver scheduling problem
399. Heuristic vehicle scheduling
400. Crew scheduling on a transportation network
401. Some fleet routing and scheduling problems for air transportation systems
402. Scheduling and fleet routing models for transportation systems
403. The fleet mix vehicle routing problem
404. Computer solutions of the traveling salesman problem
405. Heuristic programming as an aid to network design
406. An effective heuristic algorithm for the traveling salesman problem
407. An algorithm for the traveling salesman problem
408. Procedures for traveling salseman problems with additional constraints
409. CREATION—a heuristic program for crew allocation
410. Extensions of the tanker scheduling problem
411. Vehicle scheduling—a case study
412. Scheduling Vehicles in a Transportation Network, Operations Research Group
413. Modern Methods for Local Delivery Route Design
414. Optimization For Sparse Systems
415. Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects
416. Transportation Planning: Network Models and Their Implementation
417. Generalized Linear Programming Solves the Dual
418. Accelerating Benders Decomposition: Algorithmic Enhancements and Model Selection Criteria
419. On a Production Allocation and Distribution Problem
420. A heuristic solution to the M-postman's problem
421. An improvement of Orloff's general routing problem
422. Approximate solution of the traveling salesman problem by nonlocal, non-iterative methods
423. A general computer method for bus crew scheduling
424. Experiences with a bus scheduling algorithm which saves vehicles
425. Routing for Muncipal Services
426. Routing for public service vehicles
427. Locational models: solid waste collection example
428. A network solution to a general vehicle scheduling problem
429. An algorithm for large set partitioning problems
430. Crew planning at flying tiger: a successful application of integer programming
431. Exact solution of crew scheduling problems using the set partitioning model: recent successful applications
432. An L. P. algorithm for scheduling vehicles in a transportation network
433. A branch-and-bound algorithm for determining the minimal fleet size of a transportation system
434. Controlling left and U-turns in the routing of refuse collection vehicles
435. Combinatorial optimization with rational objective functions
436. Improvement on Graphic Programming
437. Graphic programming using odd or even points
438. A review of heuristic programming
439. Interger programming approaches to the traveling salesman problem
440. Using cutting planes to solve the symmetric traveling salesman problem
441. Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
442. Integer programming formulation of travelling salesman problems
443. Relationships between automated scheduling techniques for nurses and public transportation vehicle operators
444. A time-of-day model for aircraft scheduling
445. The hub operations scheduling problem
446. The Chinese postman problem for mixed networks
447. Dial-a-bus: a prototype analysis
448. Scheduling algorithms for a dial-a-bus system
449. A computer based crew scheduling system using a mathematical programming approach
450. Vehicle scheduling and driver run cutting (RUCUS) package user documentation
451. A survey of local delivery vehicle routing methodology
452. A sequential route-building algorithm employing a generalized savings criterion
453. Scheduling manpower for service operations
454. The urban postman
455. Scheduling of airline flight crews
456. Schedule planning and timetable construction for suburban railways
457. Testing of large-scale network optimization program
458. The symmetric assignment problem
459. Scheduling local and express trains
460. Set partitioning and chain decomposition
461. An analysis of approximations for maximizing submodular set functions—I
462. A school bus scheduling algorithm
463. Design of school bus routes by computer
464. Bus routing in a multi-school system
465. Multi-depot vehicle routing problems
466. A boundary method for planar traveling salesman problems
467. Optimization Techniques
468. An information system for vehicle scheduling
469. Geometric approaches to solving the traveling salesman problem
470. Heuristic for the Hamiltonian path problem in euclidean two space
471. Spanning tree manipulation and the traveling salesman problem
472. Design and analysis of heuristics for some routing and packing problems
473. Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking
474. Minimizing the number of vehicles to meet a fixed periodic schedule: an application of periodic posets
475. Minimum convex-cost dynamic network flows
476. A fundamental problem in vehicle routing
477. Routing a fleet of M vehicles to/from a central facility
478. On general routing problems Comments
479. Route constrained fleet scheduling
480. Reduction and solution of large scale vehicle routing problems
481. On the symmetric travelling salesman problem a computational study
482. The complexity of the capacitated tree problem
483. On the complexity of the Chinese postman problem
484. On the complexity of edge traversing
485. The Euclidean traveling salesman problem is NP-complete
486. The adjacency relation on the traveling salesman polytope is NP-complete
487. The complexity of local search for the traveling salesman problem
488. Some examples of difficult traveling salesman problems
489. The complexity of restricted spanning tree problems
490. Implementation and efficiency of Moore-algorithms for the shortest route problem
491. Two approaches to computer crew scheduling
492. On the use of a vehicle routing algorithm for the parallel processor problem with sequence dependent change over costs
493. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling
494. Practical aspects in automatic crew scheduling
495. Application of combinatorial programming algorithms for a class of all zero-one integer programming problems
496. Direct search algorithms for truck-dispatching problems
497. An 0 (N log N) planar traveling salesman heuristic based on spacefilling curves
498. Some elements of the airline fleet planning problem
499. Convex hulls of finite sets of points in two and three dimensions
500. Dynamic programming algorithms for specially structured sequencing and routing problems in transportation
501. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem
502. K-Interchange procedures for local search in a precedence-constrained routing problem
503. A dynamic programming approach to the dial-a-ride problem: an extension to the multi-vehicle case
504. Delivery planning by molar algorithms
505. A note on the multiple traveling salesman problem
506. Heuristic algorithm for the traveling salesman problem
507. An analysis of private and public sector location models
508. Central facilities location
509. Experience with the aircraft rotation model
510. An optimization approach to routing aircraft
511. Construction des parcours des vehicules et des horaires des chauffeurs pour le transport des personnes handicapées
512. Scheduling of postal truck drivers
513. A program for solution of large scale vehicle routing problems
514. An engineering approach to the traveling salesman problem
515. Operating cost models for urban public transportation and their use in analysis
516. Predicting operating and maintenance costs for rail rapid transit
517. An analysis of several heuristics for the traveling salesman problem
518. A school bus scheduling system
519. A technique for the solution of massive set covering problems with application to airline crew scheduling
520. Efficient truck routing for industrial refuse collection
521. An effective heuristic for the M-tour traveling salesman problem with some side conditions
522. An assignment routing problem
523. An integer programming approach to scheduling
524. An algorithm for bus scheduling problems
525. General techniques for combinatorial approximation
526. The knapsack problem: a survey
527. Timetables for a suburban rail transit system
528. The minimum fleet size for a suburban railways system
529. A note on fleet routing models for transportation systems
530. Minimum fleet size models for transportation systems
531. The status of computer-aided scheduling in North America
532. Automating extraboard assignments and coach operator timekeeping
533. Formulation and structure of more complex/realistic routing and scheduling problems
534. A practical method for vehicle scheduling
535. Heuristic routing for solid waste collection vehicles
536. The operator-sceduling problem: a network-flow approach
537. The single vehicle many to many routing and scheduling problem
538. The single vehicle many to many routing and scheduling problem with desired delivery times
539. The single vehicle many-to-many routing and scheduling problem with customer-dependent dwell times
540. Algorithms for the solution of the optimal cost travelling salesman problem
541. A survey of Lagrangian techniques for discrete optimization
542. Constants for Scheduling Operators for Urban Public Transit Systems
543. A Lagrangian relaxation algorithm for the two duty period scheduling problem
544. A tutorial on heuristic methods
545. Computerized schedule construction for an airline transportation system
546. Scheduling and routing models for airline systems
547. A review of scheduling and routing models for airline scheduling
548. A method for determination of optimum vehicle size and frequency of service for a short Haul V/STOL air transport system
549. Some new computational experiments with the TSP
550. VAMPIRES and TASC: two successfully applied bus scheduling programs
551. A LIFO implicit enumeration algorithm for the asymmetric traveling salesman problem using a onearborscence relaxation
552. Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems
553. A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxation
554. A model for large scale aircraft routing and scheduling problems
555. Solution to the crew scheduling problem
556. The computer art of schedule-making
557. An improved algorithm for computing degree-constrained minimal spanning trees
558. Some improved algorithms for computer solution to the traveling salesman problem
559. The design of minimum cost survivable networks
560. Scheduling dial-a-ride transportation systems
561. Scheduling dial-a-ride transportation system
562. An asymptotic probabilistic analysis of a routing problem
563. Optimal service policies for solid waste treatment facilities
564. Bus and crew scheduling (note)
565. A deficit function approach for bus scheduling
566. Heuristic reductions for bus fleet scheduling with large M numbers of terminals
567. The garage constrained-balance vehicle schedule minimum fleet size problem
568. Routing electric meter readers
569. Scheduling aircraft cleaning crews
570. The delivery truck routing problem with stochastic demands
571. A computationally efficient heuristic for the traveling salesman problem
572. New algorithms for deterministic and stochastic vehicle routing problems
573. A vehicle routing algorithm based on generalized Lagrange multipliers
574. A Lagrangean Relaxation Heuristic for Vehicle Routing
575. Stochastic vehicle routing: a comprehensive approach
576. A chance-constrained approach to the stochastic vehicle routing problem
577. The subscriber bus routing problem
578. Computing effective subscriber bus routes
579. A heuristic algorithm for obtaining an initial solution for the traveling salesman problem
580. Public sector vehicle routing: the Chinese postman problem
581. Public sector routing models
582. A continuous variable representation of the traveling salesman problem
583. Computational experience with and M-salesmen traveling salesman algorithm
584. Scheduling school buses
585. A new solvable case of the traveling salesman problem
586. Optimal train scheduling on a single track railway
587. Complexity of combinatorial algorithms
588. An exact algorithm for the exponential disutility dial-a-ride problem
589. Airline crew scheduling: a group theoretic approach
590. Optimal scheduling of two consecutive idle periods
591. The multiple terminal delivery problem with probabilistic demands
592. The author's reply to Uebe's
593. An upper bounding algorithm for the single and multiple terminal delivery problem
594. A heuristic approach for solving the delivery problem
595. A study of a look-ahead procedure for solving the multiterminal delivery problem
596. The location of emergency service facilities
597. Computerized route planning for school buses: design and implementation
598. A computerized system for school bus routing
599. Transportation routing problem—a survey
600. A practical method for the truck dispatching problem
601. Comments on Tillman's paper
602. Bases for vehicle fleet scheduling
603. Heuristic for the asymmetric travelling salesman problem
604. Automated pupil transportation
605. Alternative techniques for modeling travel distances
606. Rapid transit interstation spacings for minimum travel time
607. A Problem Decomposition Approach to Scheduling the Drivers and Crews of Mass Transit Systems
608. C. Watson-Gandy and L. Foulds, The vehicle scheduling problem: a survey: unpublished manuscript.
609. Some methods of producing approximate solutions to traveling salesman problems with hundreds or thousands of cities
610. Relative performance of some sequential methods of planning multiple delivery journeys
611. The savings method for vehicle scheduling—a reply
612. Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
613. Using multidimensional scaling to solve traveling salesman and machine scheduling problems
614. A network algorithm for empty freight car allocation
615. Overview of the RUCUS package driver run cutting program (RUNS)
616. Algorithm 232: Heapsort
617. Computer programs for fleet and schedule planning
618. CARS—computer aided routing system
619. Dynamic routing: a study of assignment algorithms
620. The effect of driver schedules on dial-a-ride performance
621. Computer control of the Rochester dial-a-ride system
622. Advanced dial-a-ride algorithms research project, Phase II. Interim report
623. Implementation of computer algorithms for the dial-a-bus system
624. Scheduling algorithms for a dial-a-ride system
625. Advanced dial-a-ride algorithms research project final report
626. Advanced dial-a-ride algorithms. Intern report
627. A rapid heuristic algorithm for the approximate solution of the traveling salesman problem
628. Optimal parameters for a coordinated rail and bus transit system
629. Minimizing the number of aircraft for a transportation network
630. Computer aided scheduling for wheel-tram service
631. Interger programming formulations of the traveling salesman problem
632. Techniques for vehicle operator scheduling at the Chicago Transit Authority (CTA)
633. General review of the use of computers in scheduling buses and their crews
634. Applications of computers to transport scheduling in the United Kingdom
635. Computer scheduling of vehicles from one or more depots to a number of delivery points
636. A note on determining operating strategies for probabilistic vehicle routing
637. A computational modification to the savings method of vehicle scheduling
638. Scheduling a fixed schedule common carrier passenger transportation system