Vehicle minimization for periodic deliveries

Campbell, Ann Melissa; Hardin, Jill R.

doi:10.1016/j.ejor.2003.09.036

Cited by 39 publications

(20 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 1 proves that the PPSS problem belongs to the same class. This result also follows from the strong NP-hardness of the problem discussed in Campbell and Hardin [5], which corresponds to a special case of PPSS with equal workloads. We provide a proof that allows for services with different workloads.…”

Section: Complexitysupporting

confidence: 64%

“…Campbell and Hardin [5] considered the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries, under the initial assumption that each delivery required the use of a vehicle for a full day. This problem was called vehicle minimization for periodic deliveries (VMPD) and proven to be strongly NPhard.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Balancing perfectly periodic service schedules: An application from recycling and waste management

Kazan

Dawande

Sriskandarajah

et al. 2012

Naval Research Logistics

View full text Add to dashboard Cite

Abstract:A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck-hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP-hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real-world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average.

show abstract

Section: Complexitysupporting

confidence: 64%

Section: Literature Reviewmentioning

confidence: 99%

Balancing perfectly periodic service schedules: An application from recycling and waste management

Kazan

Dawande

Sriskandarajah

et al. 2012

Naval Research Logistics

View full text Add to dashboard Cite

show abstract

“…More works related to multi-period service scheduling problems can be found in Campbell and Hardin (2005) and Korst et al (1994). The former considers a replenishment activity on xed time intervals.…”

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

“…These papers considered unit-length jobs on a single machine. Other work on periodic scheduling are Korst et al (1997), Campbell and Hardin (2005), Grigoriev et al (2006). In the generalized model, each job has an arbitrary length and it can be scheduled on multiple machines.…”

Section: Related Workmentioning

confidence: 99%