The workforce scheduling and routing problem with park-and-loop

DOI10.1002/NET.22250MaRDI QIDQ6663965FDOQ6663965

Authors: Nicolás Cabrera, Jean-François Cordeau, Jorge E. Mendoza 

Publication date: 15 January 2025

Published in: Networks (Search for Journal in Brave)

Recommendations

• The doubly open park-and-loop routing problem
• Workforce scheduling and routing problems: literature survey and computational study
• Arc routing for parking enforcement officers: exact and heuristic solutions
• Branch-and-price for a multi-attribute technician routing and scheduling problem
• Exact and hybrid methods for the multiperiod field service routing problem

zbMATH Keywords

schedulingcolumn generationvehicle routing problembranch-price-and-cutpark-and-loop

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Selected Topics in Column Generation
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Workforce scheduling and routing problems: literature survey and computational study
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• 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 multiperiod workforce scheduling and routing problem with dependent tasks
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
• Resource constrained routing and scheduling: review and research prospects
• Task assignment with start time-dependent processing times for personnel at check-in counters
• Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
• Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
• Workforce routing and scheduling for electricity network maintenance with downtime minimization
• Exact and hybrid methods for the multiperiod field service routing problem
• An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
• The doubly open park-and-loop routing problem
• Vehicle routing with transportable resources: using carpooling and walking for on-site services
• 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)