19 July 2022 in Applied Soft Computing
21 October 2020 in Complexity
The multi-compartment vehicle routing problem (MCVRP) has been applied in fuel or food delivery, waste collection, and livestock transportation. Ant colony optimization algorithm (ACO) has been recognized as an efficient method to solve the VRP and its variants. In this paper, an improved hybrid ant colony optimization algorithm (IHACO) is proposed to minimize the total mileage of the MCVRP. First, a probabilistic model is designed to guide the algorithm search towards high-quality regions or solutions by considering both similar blocks of customers and customer permutations. Then, a heuristic rule is presented to generate initial individuals to initialize the probabilistic model, which can drive the search to the high-quality regions faster. Moreover, a new local search using the geometry optimization is developed to execute exploitation from the promising regions. Finally, two types of variable neighborhood descent (VND) techniques based on the speed-up search strategy and the first move strategy are devised to further enhance the local exploitation ability. Comparative numerical experiments with other algorithms and statistical analyses are carried out, and the results show that IHACO can achieve better solutions.
15 January 2016 in Medical Physics
Purpose: The assessment of early therapeutic response to anticancer therapy is vital for treatment planning and patient management in clinic. With the development of personal treatment plan, the early treatment response, especially before any anatomically apparent changes after treatment, becomes urgent need in clinic. Positron emission tomography (PET) imaging serves an important role in clinical oncology for tumor detection, staging, and therapy response assessment. Many studies on therapy response involve interpretation of differences between two PET images, usually in terms of standardized uptake values (SUVs). However, the quantitative accuracy of this measurement is limited. This work proposes a statistically robust approach for therapy response assessment based on Gaussian random field (GRF) to provide a statistically more meaningful scale to evaluate therapy effects.Methods: The authors propose a new criterion for therapeutic assessment by incorporating image noise into traditional SUV method. An analytical method based on the approximate expressions of the Fisher information matrix was applied to model the variance of individual pixels in reconstructed images. A zero mean unit variance GRF under the null hypothesis (no response to therapy) was obtained by normalizing each pixel of the post‐therapy image with the mean and standard deviation of the pretherapy image. The performance of the proposed method was evaluated by Monte Carlo simulation, where XCAT phantoms (1282 pixels) with lesions of various diameters (2–6 mm), multiple tumor‐to‐background contrasts (3–10), and different changes in intensity (6.25%–30%) were used. The receiver operating characteristic curves and the corresponding areas under the curve were computed for both the proposed method and the traditional methods whose figure of merit is the percentage change of SUVs. The formula for the false positive rate (FPR) estimation was developed for the proposed therapy response assessment utilizing local average method based on random field. The accuracy of the estimation was validated in terms of Euler distance and correlation coefficient.Results: It is shown that the performance of therapy response assessment is significantly improved by the introduction of variance with a higher area under the curve (97.3%) than SUVmean (91.4%) and SUVmax (82.0%). In addition, the FPR estimation serves as a good prediction for the specificity of the proposed method, consistent with simulation outcome with ∼1 correlation coefficient.Conclusions: In this work, the authors developed a method to evaluate therapy response from PET images, which were modeled as Gaussian random field. The digital phantom simulations demonstrated that the proposed method achieved a large reduction in statistical variability through incorporating knowledge of the variance of the original Gaussian random field. The proposed method has the potential to enable prediction of early treatment response and shows promise for application to clinical practice. In future work, the authors will report on the robustness of the estimation theory for application to clinical practice of therapy response evaluation, which pertains to binary discrimination tasks at a fixed location in the image such as detection of small and weak lesion.
1 September 2026 in SSRN Electronic Journal
The multi compartment vehicle routing problem (MCVRP) is critical in urban logistics, yet existing studies are largely confined to single echelon networks with homogeneous fleets, overlooking urban access restrictions and inefficient capacity use. This paper investigates a two-echelon heterogeneous MCVRP with direct deliveries and soft time windows (2E HMCVRP with DD&STW), in which first echelon vehicles may serve customers directly under access time windows while second-echelon services incur penalties for time-window deviations. To solve this NP-hard and strongly coupled problem, a clustering based adaptive large neighborhood search, enhanced with a Basic and Pipe Variable Neighborhood Descent (BPVND) mechanism, is proposed and denoted as C-ALNS-BPVND. The main innovations are threefold: K-means clustering decouples the problem into independent satellite-level subproblems; a cost-capacity ratio (CCR) strategy guides heterogeneous fleet assignment by balancing operational costs against capacity utilization; and a BPVND-enhanced local search further refines routing structures. Extensive experiments on 30 benchmark instances show that the proposed algorithm outperforms five state-of-the-art metaheuristics in both solution quality and stability. Ablation studies validate the individual contributions of the clustering strategy, the CCR strategy, and the BPVND mechanism.