An Integer Programming Approach to the Vehicle Scheduling Problem

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

Cited In (55)

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

This page was built for publication: An Integer Programming Approach to the Vehicle Scheduling Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093231)