The workforce scheduling and routing problem with park-and-loop
From MaRDI portal
Publication:6663965
DOI10.1002/net.22250MaRDI QIDQ6663965
Jean-François Cordeau, Nicolás Cabrera, Jorge E. Mendoza
Publication date: 15 January 2025
Published in: Networks (Search for Journal in Brave)
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Workforce scheduling and routing problems: literature survey and computational study
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- On an exact method for the constrained shortest path problem
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Task assignment with start time-dependent processing times for personnel at check-in counters
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- Resource constrained routing and scheduling: review and research prospects
- Exact and hybrid methods for the multiperiod field service routing problem
- The doubly open park-and-loop routing problem
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
- A multiperiod workforce scheduling and routing problem with dependent tasks
- Vehicle routing with transportable resources: using carpooling and walking for on-site services
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Workforce routing and scheduling for electricity network maintenance with downtime minimization
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Selected Topics in Column Generation
- Small and large neighborhood search for the park-and-loop routing problem with parking selection
This page was built for publication: The workforce scheduling and routing problem with park-and-loop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663965)