2009
DOI: 10.1016/j.ejor.2007.08.048
|View full text |Cite
|
Sign up to set email alerts
|

A variable neighborhood search heuristic for periodic routing problems

Abstract: The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days for each customer and to solve a VRP for each day. Our method is based on Variable Neighborhood Search (VNS). Computati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
119
0
1

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 250 publications
(121 citation statements)
references
References 34 publications
1
119
0
1
Order By: Relevance
“…The temperature for the SA acceptance criterion is set to 15 in the beginning for the MDVRPI and the real world instances and to 7 for the PVRP-IF instances and is decreased every 1000 iterations, in a way that it becomes 0 in the last 1000 iterations. We chose these parameter settings based on the performance of the VNS on previous work on the PVRP (see Hemmelmayr et al 2009) and also on new extensive parameter tests.…”
Section: Parameter Settingsmentioning
confidence: 99%
“…The temperature for the SA acceptance criterion is set to 15 in the beginning for the MDVRPI and the real world instances and to 7 for the PVRP-IF instances and is decreased every 1000 iterations, in a way that it becomes 0 in the last 1000 iterations. We chose these parameter settings based on the performance of the VNS on previous work on the PVRP (see Hemmelmayr et al 2009) and also on new extensive parameter tests.…”
Section: Parameter Settingsmentioning
confidence: 99%
“…In particular, all the papers cited above assume that the routing decisions are taken on the basis of a single time period (e.g., day), and do not incorporate the possibility that collections might be made on different days for different customers. In this sense, our problem resonates with the periodic vehicle routing problem (e.g., Hemmelmayr et al, 2009), with the exception that the visit days in our study are decided by the decision maker, as opposed to being imposed by the customers. This paper is therefore concerned with the joint multiperiod problem of locating ultrafiltration facilities and routing decisions for the collection and treatment of OMWW.…”
Section: Introductionmentioning
confidence: 99%
“…A heuristic algorithm for the PVRP based on an algorithm designed for the VRP (see [12]) can be found in [28]. Some later references are [3] that presents a two-stage heuristic for a real PVRP for the collection of recycling paper containers, and [19] that proposes a heuristic based on variable neighborhood search. A twophase approach for the tactical problem of deciding dates to visit customers and assigning them to vehicles is presented in [22], leaving the sequencing decisions to be decided on an operational level.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (19) are time window constraints, and ensure that the service at an installation starts within the time window on the day the service begins. Constraints (20) ensure that a service at an installation can only start on one specific day if the installation is visited on the voyage.…”
Section: T C Vmentioning
confidence: 99%