We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
An Assignment Heuristic for Time-Dependent Periodic Routing Problems with Complex Constraints.
- Authors
Śliwiński, Tomasz
- Abstract
Periodic routing and scheduling is of the utmost importance in many industries with mobile personnel working in the field: sales representatives, service technicians, suppliers, etc. In many cases, the long-term stability of the customer to salesman assignment is required, leading to the decomposition of the major problem into single salesman subproblems. The paper addresses the assignment of customers to salesmen for the future services performed in a periodic fashion. It can be seen as the decomposition phase of the periodic vehicle routing problem PVRP into a number of Periodic Traveling Salesman Problems (PTSP). The proposed algorithm seeks the best assignment by taking into account diverse system requirements, constraints and expected operational costs including time windows, time-dependent travel times and costs, and labor laws.
- Subjects
TRAVELING salesman problem; VEHICLE routing problem; LABOR costs; SALES force management; COMBINATORIAL optimization
- Publication
Decision Making in Manufacturing & Services, 2020, Vol 14, Issue 2, p181
- ISSN
1896-8325
- Publication type
Article
- DOI
10.7494/dmms.2020.14.2.2690