An Integer Programming Approach to the Vehicle Scheduling Problem

DOI10.1057/jors.1976.63zbMath0327.90030OpenAlexW2012355441MaRDI QIDQ4093231

B. A. Foster, David M. Ryan

Publication date: 1976

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1976.63

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Traffic problems in operations research (90B20)

Related Items

Solving the minimum convex partition of point sets with integer programming, Implementation techniques for the vehicle routing problem, A surrogate heuristic for set covering problems, A TSSP+1 decomposition strategy for the vehicle routing problem, The savings algorithm for the vehicle routing problem, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, On the integer properties of scheduling set partitioning models, Adaptive memory programming for the vehicle routing problem with multiple trips, A bi-criteria heuristic for the vehicle routing problem with time windows, Simultaneous disruption recovery of a train timetable and crew roster in real time, Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport, A Lagrangean relaxation heuristic for vehicle routing, A binary cat swarm optimization algorithm for the non-unicost set covering problem, A hybrid heuristic for the set covering problem, A multi-space sampling heuristic for the vehicle routing problem with stochastic demands, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, Vehicle routing on road networks: how good is Euclidean approximation?, The home care crew scheduling problem: preference-based visit clustering and temporal dependencies, A matheuristic for the asymmetric capacitated vehicle routing problem, A new mixed integer programming approach for inverse correspondence analysis, Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019, Last‐mile delivery with drone and lockers, Scheduling trainees at a hospital department using a branch-and-price approach, Solving a continuous local access network design problem with a stabilized central column generation approach, A branch-and-price approach for operational aircraft maintenance routing, Supply chain optimization in the pulp mill industry -- IP models, column generation and novel constraint branches., Heuristics for vehicle routing problems: sequence or set optimization?, The column-circular, subsets-selection problem: Complexity and solutions, The Period Vehicle Routing Problem and its Extensions, Enhancing an algorithm for set covering problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, The vehicle routing problem: An overview of exact and approximate algorithms, Polyhedral study of the capacitated vehicle routing problem, A branch-and-price approach for integrating nurse and surgery scheduling, An adaptive memory algorithm for the split delivery vehicle routing problem, A branch and bound algorithm for the capacitated vehicle routing problem, A branch-and-price algorithm for an integrated production and inventory routing problem, Simulation-based evolution of resupply and routing policies in rich vendor-managed inventory scenarios, A structure for distribution studies, A survey on matheuristics for routing problems, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, A generalized exchange heuristic for the capacitated vehicle routing problem, Forty years of periodic vehicle routing, Developing work schedules for an inter-city transit system with multiple driver types and fleet types, Column generation for minimizing total completion time in a parallel-batching environment, An algorithm for set covering problem, A self-adaptive biogeography-based algorithm to solve the set covering problem, The train driver recovery problem-a set partitioning based model and solution method, A sweep-based algorithm for the fleet size and mix vehicle routing problem, Vehicle routing via column generation, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Algorithms for large scale set covering problems, A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs