Forty years of periodic vehicle routing

Campbell, Ann Melissa; Wilson, Jill H.

doi:10.1002/net.21527

Cited by 138 publications

(67 citation statements)

References 79 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In recent years, its variants have grown ever more popular in the literature (as discussed by Gendreau et al (2005a,b); Eksioglu et al [106]; Braekers et al [107]), though current models vary widely as more and more researchers aim to enable their models to cope with real-life complexities and the literature on vehicle routing problems has been growing exponentially at a rate of 6% each year [106,107] and many surveys focused on specific variants can be observed as well [108][109][110][111][112][113][114][115][116][117][118][119]. In general, the classical vehicle routing problem can be defined on a graph = ( , ), where = {0, 1, .…”

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…The PVRP is first proposed by Beltrami and Bodin (1974) to route and schedule periodic collection of municipal waste in one of the earliest papers applying vehicle routing to waste collection. Reviews of the PVRP literature can be found in Francis et al (2008) and Campbell and Wilson (2014). The LRP is the single-period version of the PLRP.…”

Section: Related Modeling Literaturementioning

confidence: 99%

A periodic location routing problem for collaborative recycling

Hemmelmayr

Smilowitz

Torre³

2016

IISE Transactions

View full text Add to dashboard Cite

Motivated by collaborative recycling efforts for non-profit agencies, we study a variant of the periodic location routing problem, in which one decides the set of open depots from the customer set, the capacity of open depots, and the visit frequency to nodes, in an effort to design networks for collaborative pickup activities.We formulate this problem, highlighting the challenges introduced by these decisions. We examine the relative difficulty introduced with each decision through exact solutions and a heuristic approach which can incorporate extensions of model constraints and solve larger instances. The work is motivated by a project with a network of hunger relief agencies (e.g., food pantries, soup kitchens and shelters) focusing on collaborative approaches to address their cardboard recycling challenges collectively. We present a case study based on data from the network. In this novel setting, we evaluate collaboration in terms of participation levels and cost impact. These insights can be generalized to other networks of organizations that may consider pooling resources.

show abstract

“…In these applications operators correspond to vehicles and tours have to be built such that no stock-outs occur at the retailers and the routing and inventory costs are minimal. Some examples are mentioned in Campbell and Wilson (2014) and Coelho et al (2013). The operator costs resemble costs for vehicle usage and the service request costs can model inventory costs.…”

Section: Practical Applications and Related Literaturementioning

confidence: 99%

Scheduling policies for multi-period services

Nunez-del-Toro

Fernández

Kalcsics

et al. 2016

European Journal of Operational Research

View full text Add to dashboard Cite

This paper discusses a multi-period service scheduling problem. In this problem, a set of customers is given who periodically require service over a finite time horizon. To satisfy the service demands, a set of operators is given, each with a fixed capacity in terms of the number of customers an operator can serve per period. The task is to determine for each customer the periods in which he will be visited by an operator such that the periodic service requests of the customers are adhered to and the total number of operators used over the time horizon is minimal. Two alternative policies for scheduling customer visits are considered. In the first one, a customer is visited just on time, i.e., in the period where he or she has a demand for service. The second policy allows service visits ahead of time. The rationale behind this policy is that allowing irregular visits may reduce the overall number of operators needed throughout the time horizon. To solve the problem, integer linear programming formulations are proposed for both policies and numerical experiments are presented that show the reduction in the number of operators used when visits ahead of time are allowed. As only small instances can be solved optimally, a heuristic algorithm is introduced in order to obtain good quality solutions and shorter computing times.Peer ReviewedPostprint (author's final draft

show abstract

Forty years of periodic vehicle routing

Cited by 138 publications

References 79 publications

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

A periodic location routing problem for collaborative recycling

Scheduling policies for multi-period services

Contact Info

Product

Resources

About