Exact and hybrid methods for the multiperiod field service routing problem
From MaRDI portal
Publication:1788906
DOI10.1007/s10100-011-0231-6zbMath1397.90102OpenAlexW2039939859MaRDI QIDQ1788906
Fabien Tricoire, Pierre Guez, Nathalie Bostel, Pierre Dejax
Publication date: 9 October 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-011-0231-6
column generationvehicle routinghybrid methodsbranch and pricefield service logisticsTechnician routing
Related Items (6)
Dynamic dispatching and repositioning policies for fast-response service networks ⋮ A multiperiod workforce scheduling and routing problem with dependent tasks ⋮ Enhanced iterated local search for the technician routing and scheduling problem ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ The sales force sizing problem with multi-period workload assignments, and service time windows ⋮ Optimizing logistics routings in a network perspective of supply and demand nodes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Scheduling technicians and tasks in a telecommunications company
- Vehicle routing problem with time windows and a limited number of vehicles.
- Solving VRPTWs with constraint programming based column generation
- Probabilistic diversification and intensification in local search for vehicle routing
- A variable neighborhood search heuristic for periodic routing problems
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Drive: Dynamic Routing of Independent Vehicles
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An emergency vehicle dispatching system for an electric utility in Chile
- A multi-depot period vehicle routing problem arising in the utilities sector
- A Linear Programming Approach to the Cutting-Stock Problem
- The period routing problem
- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An asynchronous parallel metaheuristic for the period vehicle routing problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Networks and vehicle routing for municipal waste collection
- An improved heuristic for the period vehicle routing problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: Exact and hybrid methods for the multiperiod field service routing problem
