A parallel matheuristic for the Technician Routing and Scheduling Problem (original) (raw)

On the Technician Routing and Scheduling Problem

9th Metaheuristics International Conference (MIC 2011), Udine, Italy, 2011

The technician routing and scheduling problem consists in routing and scheduling a crew of technicians in order to attend a set of service requests, subject to skill, tool, and spare part constraints. In this study we propose a formal definition of the problem and present a constructive heuristic and a large neighborhood search optimization algorithm.

Vehicle Routing Problem with elementary shortest path based column

Computers\ & …

This document is an appendix to the paper entitled "A parallel matheuristic for the Technician Routing and Scheduling Problem". It contains the detail of the new best solutions reported, the detailed parameter setting for computational experiments, and a description of the random instances that were generated and used in the aforementioned work.

Proposal of a Dynamic Algorithm for the Maintenance and Vehicle Routing Problem with Time Windows

Ingeniería, 2022

Context: In the context of business organizations, every process in which the product is immersed has a cost and time associated with it. The area of maintenance planning and scheduling is no exception; however, it is an aspect in which few companies specialize, tending to be outsourced. In this sense, the application of combinatorial models is a tool with a high potential to improve the overall performance of the organization through the understanding of the integral maintenance process. Method: A two-phase (maintenance and routing) dynamic algorithm is proposed which considers a set of clients distributed in a maintenance network (distance), where each of the technicians start from the same central node (depot), which, in turn, is the endpoint of each assigned route. The objective is to minimize the total cost associated with the development of preventive and corrective maintenance of all machines to be evaluated. With this purpose, the formulation of the mathematical problem for...

Parallelization of the vehicle routing problem with time windows

1999

This Ph. D. thesis entitled “Parallelization of the Vehicle Routing Problem with Time Windows” has been prepared by Jesper Larsen during the period June 1995 to May 1999, partly at the Department of Computer Science (DIKU) at the University of Copenhagen, partly at the Department of Mathematical Modelling (IMM) at the Technical University of Denmark (DTU).

Routing Solutions for the Service Industry

Routing and Scheduling Solutions

First introduced by Dantzig and Ramser over 50 years ago, vehicle routing problems (VRP) have drawn the attention of both academic researchers and practitioners due to its difficult-to-solve nature and hence its attractiveness in theoretical research as well as wide applicability in real-world settings. Today VRP is probably one of the most widely encountered types of problems for routing and distribution in the service industry. Examples include furniture delivery to a customer's address, scheduling of bus service pick-up/drop-off for students or company personnel, or service technician routing. The goal of this chapter is to provide a background, mathematical model and various solution approaches on a more commonly encountered variant of the problem, namely the VRP with Time Windows (VRPTW).

Technician teaming and routing with service-, cost- and fairness-objectives

Computers & Industrial Engineering, 2019

In workforce routing and scheduling there are many applications in which differently skilled workers must perform jobs that occur at different locations, where each job requires a particular combination of skills. In many such applications, a group of workers must be sent out to provide all skills required by a job. Examples are found in maintenance operations, the construction sector, health care operations, or consultancies. In this paper, we analyze the combined problem of composing worker groups (teams) and routing these teams under goals expressing service-, fairness-, and cost-objectives. We develop mathematical optimization models for an integrated solution and a sequential solution of the teaming-and routing-subproblems. Computational experiments are conducted to identify the tradeoff of better solution quality and computational effort that comes along with solving the subproblems within a combined monolithic model and within bi-level decomposition schemes. We further analyze the impact of the qualification of employees on the different objectives.

The Time Window Assignment Vehicle Routing Problem

Transportation Science, 2014

I n this paper we introduce the time window assignment vehicle routing problem (TWAVRP). In this problem, time windows have to be assigned before demand is known. Next, a realization of demand is revealed, and a vehicle routing schedule is made that satisfies the assigned time windows. The objective is to minimize the expected traveling costs. We propose a branch-price-and-cut algorithm to solve the TWAVRP to optimality. We provide results of computational experiments performed using this algorithm. Finally, we offer insight on the value of an exact approach for the TWAVRP by comparing the optimal solution to the solution found by assigning time windows based on solving a vehicle routing problem with time windows with average demand.

On the reformulation of vehicle routing problems and scheduling problems

2002

We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP's, as does scheduling technology on reformulated VRP's.