The Period Vehicle Routing Problem with Service Choice

Authors:
Peter Francis;Karen Smilowitz;Michal Tzur
Affiliations:
Industrial Engineering and Management Sciences Department, Northwestern University, 2145 Sheridan Road, Technological Institute, Evanston, Illinois 60208-3119;Industrial Engineering and Management Sciences Department, Northwestern University, 2145 Sheridan Road, Technological Institute, Evanston, Illinois 60208-3119;Industrial Engineering Department, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Transportation Science
Year:
2006

Citing 6
Cited 12

One warehouse multiple retailer systems with vehicle routing costs

Management Science
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities

Transportation Science
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models

Operations Research
The Stochastic Inventory Routing Problem with Direct Deliveries

Transportation Science
A Periodic Inventory Routing Problem at a Supermarket Chain

Operations Research
Traveling Salesman Problems with Profits

Transportation Science

Developing a Deterministic Patrolling Strategy for Security Agents

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem

Computers and Operations Research
An Exact Algorithm for the Period Routing Problem

Operations Research
A metaheuristic for a teaching assistant assignment-routing problem

Computers and Operations Research
Flexible variable neighborhood search in dynamic vehicle routing

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Time Slot Management in Attended Home Delivery

Transportation Science
Patrolling security games: Definition and algorithms for solving large instances with single patroller and single intruder

Artificial Intelligence
Workforce Management in Periodic Delivery Operations

Transportation Science
Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem

Simulation
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
A set-covering based heuristic algorithm for the periodic vehicle routing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The period vehicle routing problem (PVRP) is a variation of the classic vehicle routing problem in which delivery routes are constructed for a period of time (for example, multiple days). In this paper, we consider a variation of the PVRP in which service frequency is a decision of the model. We refer to this problem as the PVRP with service choice (PVRP-SC). We explore modeling issues that arise when service choice is introduced, and suggest efficient solution methods. Contributions are made both in modeling this new variation of the PVRP and in introducing an exact solution method for the PVRP-SC. In addition, we propose a heuristic variation of the exact method to be used for larger problem instances. Computational tests show that adding service choice can improve system efficiency and customer service. We also present general insights on the impact of node distribution on the value of service choice.