A variable neighborhood search heuristic for periodic routing problems

Hemmelmayr, Vera C.; Doerner, Karl F.; Hartl, Richard F.

doi:10.1016/j.ejor.2007.08.048

Cited by 247 publications

(121 citation statements)

References 34 publications

(34 reference statements)

Supporting

Mentioning

119

Contrasting

Unclassified

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%

A heuristic solution method for node routing based solid waste collection problems

et al. 2011

Self Cite

View full text Add to dashboard Cite

This paper considers a real world waste collection problem in which glass, metal, plastics, or paper is brought to certain waste collection points by the citizens of a certain region. The collection of this waste from the collection points is therefore a node routing problem. The waste is delivered to special sites, so called intermediate facilities (IF), that are typically not identical with the vehicle depot. Since most waste collection points need not be visited every day, a planning period of several days has to be considered. In this context three related planning problems are considered. First, the periodic vehicle routing problem with intermediate facilities (PVRP-IF) is considered and an exact problem formulation is proposed. A set of benchmark instances is developed and an efficient hybrid solution method based on variable neighborhood search and dynamic programming is presented. Second, in a real world application the PVRP-IF is modified by permitting the return of partly loaded vehicles to the depots and by considering capacity limits at the IF. An average improvement of 25% in the routing cost is obtained compared to the current solution. Finally, a different but related problem, the so called multi-depot vehicle routing problem with inter-depot

show abstract

Section: Parameter Settingsmentioning

confidence: 99%

A heuristic solution method for node routing based solid waste collection problems

et al. 2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…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 multiperiod location-routing problem arising in the collection of Olive Oil Mill Wastewater

Tunalıoğlu

Koç

Bektaş

2016

Journal of the Operational Research Society

View full text Add to dashboard Cite

The process by which olive oil is produced yields two by-products, one of which is the brown coloured Olive Oil Mill Wastewater (OMWW) and has no direct use. OMWW is generally disposed of into soil or rivers, potentially contaminating the environment. OMWW can be treated using ultrafiltration facilities, but this requires that OMWW is collected from oil mills and delivered to the treatment facilities using a fleet of vehicles in an economically viable manner. Such considerations give rise to a multiperiod locationrouting problem. This paper formally introduces the problem and proposes an adaptive large neighbourhood search metaheuristic for its solution. The algorithm is applied on a case study drawn from one of the major olive oil producing countries. The paper presents computational and managerial results.

show abstract

“…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%

Optimization in offshore supply vessel planning

Halvorsen-Weare

Fagerholt

2016

Optim Eng

View full text Add to dashboard Cite

This paper considers the offshore supply vessel (OSV) planning problem, which consists of determining an optimal fleet size and mix of OSVs as well as their weekly routes and schedules for servicing offshore oil and gas installations. The work originates from a project with Statoil, the leading operator on the Norwegian continental shelf. We present both a new arc-flow and a voyage-based model for solving the OSV planning problem. A decision support tool based on the voyage-based model has been used by planners in Statoil, and cost savings from this was estimated to approximately 3 million USD/year. Weather conditions at the Norwegian continental shelf can be harsh; wave heights may limit both an OSV's sailing speed and the time to perform unloading/loading operations at the installations. Hence, we analyze the weather impact on the execution of a schedule and propose robustness approaches to obtain solutions that can better withstand delays due to rough weather. Simulations indicate that such solutions both are more robust and have lower expected costs.

show abstract

A variable neighborhood search heuristic for periodic routing problems

Cited by 247 publications

References 34 publications

A heuristic solution method for node routing based solid waste collection problems

A heuristic solution method for node routing based solid waste collection problems

A multiperiod location-routing problem arising in the collection of Olive Oil Mill Wastewater

Optimization in offshore supply vessel planning

Contact Info

Product

Resources

About