Discrete OptimizationThe nuclear medicine production and delivery problem
Introduction
To our knowledge, no previous work has considered the nuclear medicine production and delivery problems (NMPDP) posed by F-18, an isotope that requires scrupulous determination of manufacturing levels as well as accounting for its rapid deterioration. In this paper we develop a mixed integer programming (MIP) model and propose a variant of a large neighborhood search (LNS) algorithm with various improvement algorithms. We conduct several computational experiments to demonstrate the effectiveness of the proposed approach. We conclude that the approach will help manufacturers and the medical community produce and deliver F-18 considering both time and cost.
The remainder of this paper is organized as follows. The detailed problem is described in Section 2. A literature review is presented in Section 3. The MIP model and our proposed approach are presented in Sections 4 Mathematical model, 5 Solution method. Our experimental results are shown in Section 6. A case study is presented in Section 7 and our concluding remarks are presented in Section 8.
Section snippets
Problem description
The description below is based on a manufacturer that produces only radioisotope F-18 that we observed. Physicians order nuclear medicine, such as F-18, based on a specified level of radiation according to their injection plans for the medicine. The manufacture gathers a set of customer orders a day in advance, each of which corresponds to a hospital and perhaps multiple patients, and schedules delivery vehicles to visit each hospital. Each customer has a requested quantity of F-18 and time
Literature review
The nuclear medicine delivery problem resembles some perishable food and newspaper delivery problems. This section briefly reviews these studies and research efforts.
Tarantilis and Kiranoudis (2001) consider fresh milk distribution for a diary company in Athens, Greece, and propose a modified version of the threshold-acceptance algorithm of Dueck and Scheuer (1990), which is a deterministic version of the simulated annealing algorithm. Tarantilis and Kiranoudis (2001) treat the problem as a
Mathematical model
This section introduces an MIP model for scheduling the production and delivery of radioisotope F-18 to closely match demand. This paper uses the following notation:Indices i, j customer stop index, 1, 2, … , n; 0 = plant index (start location); n + 1 = plant index (final location) v vehicle index, 1, 2, … , V h vehicle tours index, 1, 2, … , H k machine index, 1, 2, … , K p production run index, 1, 2, … , P Parameters di customer i demanded quantity [ei, li] time window of customer i; li = the exact time the medicine is used ck production
Solution method
LNS, a state-of-the-art meta heuristics, has been shown to perform well on various combinatorial optimization problems including vehicle routing problems (Kim et al., 2012, Kim et al., 2012, Pisinger and Ropke, 2010, Prescott-Gagnon et al., 2009, Ropke and Pisinger, 2006, Shaw, 1977, Wy and Kim, 2013). While local search heuristics attempt to improve solutions via incremental adjustments to current solutions, LNS perturbs a current solution significantly within a large neighborhood. Pisinger
Experimental results
We use the C++ language to implement the algorithms and an Intel Core(TM) i7 CPU 920 with 2.67 giga hertz, 6 gigabytes RAM running Windows 7 Enterprise for our eight scenarios. Because the previous research has not considered the NMPDP and there is no publicly available benchmark data, we develop 29 benchmark instances by extending the benchmark problem instances for the VRPTW (Solomon, 1987); we use the VRPTW benchmarks because VRPTW is an embedded sub-problem of the NMPDP and the optimal
Case study
This problem is motivated by a company producing and delivering radioisotope F-18.2 The problem instance has 277 customer stops and a total demand of 3672.1 mCi. The lower bound on the production quantity calculated by the method stated in the previous Section is 42242.9 mCi, which is more than 11.5 times the total demand. This large ratio is partially due to the long distances between the plant and the customers. While the current practice
Conclusions
This paper described a nuclear medicine production and delivery problem (NMPDP) in which the production quantity of the medicine, F-18, for a customer varied depending on when it was produced due to a half-life of 110 minutes, and the production time determines the vehicle’s earliest departure time from the plant to the customer. F-18’s half-life, a unique characteristic, makes this NMPDP different from other perishable product delivery, newspaper delivery, and integrated production and
Acknowledgments
This work was supported by the National Research Foundation of Korea Grant funded by the Korean Government (No. 2012R1A1A2005243).
References (42)
On-line integrated production–distribution scheduling problems with capacitated deliveries
European Journal of Operational Research
(2010)Vehicle routing problem with elementary shortest path based column generation
Computers & Operations Research
(2006)- et al.
Coordination of production and distribution planning
European Journal of Operational Research
(1994) - et al.
Production scheduling and vehicle routing with time windows for perishable food products
Computers and Operations Research
(2009) - et al.
Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Journal of Computational Physics
(1990) - et al.
The pickup and delivery problem with time windows
European Journal of Operational Research
(1991) - et al.
Production and vehicle scheduling for ready-mix operations
Computers and Industrial Engineering
(2004) - et al.
Vehicle routing problem with time-windows for perishable food delivery
Journal of Food Engineering
(2007) - et al.
A column generation approach for the split delivery vehicle routing problem
Operations Research Letters
(2008) - et al.
A school bus scheduling problem
European Journal of Operational Research
(2012)
Machine scheduling with deliveries to multiple customer locations
European Journal of Operational Research
A practical solution to a newspaper distribution problem
International Journal of Production Economics
A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food
Journal of Food Engineering
A general heuristic for vehicle routing problems
Computers and Operations Research
The two-dimensional bin packing problem with variable bin sizes and costs
Discrete Optimization
Integrating multi-product production and distribution in newspaper logistics
Computers and Operations Research
A practical approach to solving a newspaper logistics problem using a digital map
Computers and Industrial Engineering
A meta-heuristic algorithm for the efficient distribution of perishable foods
Journal of Food Engineering
Solving the medium newspaper production/distribution problem
European Journal of Operational Research
A hybrid metaheuristic approach for the rollon–rolloff problem
Computers and Operations Research
Cited by (41)
Integrated production scheduling and vehicle routing problem with energy efficient strategies: Mathematical formulation and metaheuristic algorithms
2024, Expert Systems with ApplicationsA review on integrated scheduling and outbound vehicle routing problems
2023, European Journal of Operational ResearchHybrid metaheuristics for the integrated and detailed scheduling of production and delivery operations in no-wait flow shop systems
2022, Computers and Industrial EngineeringMulti-trip heterogeneous vehicle routing problem coordinated with production scheduling: Memetic algorithm and simulated annealing approaches
2021, Computers and Industrial EngineeringSolving an integrated scheduling and routing problem with inventory, routing and penalty costs
2021, European Journal of Operational ResearchPerformance evaluation of automated medicine delivery systems
2021, Transportation Research Part E: Logistics and Transportation ReviewCitation Excerpt :Different from traditional products, medicines often need special care during the delivery because of special characteristics (De Vries and Huijsman, 2011), such as temperature conditioning or decay control for radioactive substances used in a variety of medical treatments. Lee et al. (2014) propose a mixed integer programming model and a large neighborhood search algorithm to optimize the delivery of the radioisotope F-18, used for cancer diagnosis and monitoring, with the objective of minimizing the delivery lead time. Mixed integer programming is one of methods used to model the medicine delivery problem (Erbeyoglu and Bilge, 2020; Rath and Gutjahr, 2014).