Design and analysis of a satellite network with direct delivery in the pharmaceutical industry

Zhu, Stuart X.; Ursavas, Evrim

doi:10.1016/j.tre.2018.06.005

Cited by 21 publications

(23 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second most addressed problem type was spatial analysis, which represents 32.74% of the papers. All the studies that performed some level of descriptive analysis, inference, or observation of spatial properties of events used [13], [44], [45], [47]- [50], [52]- [55], [60], [64], [65], [76], [78], [80]- [91], [95]- [97], [101], [102], [104], [107]- [109], [111]- [115], [117], [118], [121], [126], [138], [143]- [148], [150]- [152], [155], [157], [159], [161], [163], [166]- [171], [174]- [184], [186], [192], [196], [198], [199] Spatial analysis 55 32.74% [11],…”

Section: A Problem Type Findingsmentioning

confidence: 99%

Location Data Analytics in the Business Value Chain: A Systematic Literature Review

2020

View full text Add to dashboard Cite

Section: A Problem Type Findingsmentioning

confidence: 99%

Location Data Analytics in the Business Value Chain: A Systematic Literature Review

2020

View full text Add to dashboard Cite

“…Within [17,Figs. 1,2,[5][6][7][8], the SAVLR method showed the advantage over the above SLR method to solve GAPs. For completeness of comparison with the newly-developed SLBLR method, SAVLR is also included in Table 3.…”

Section: Discussionmentioning

confidence: 94%

Surrogate "Level-Based" Lagrangian Relaxation for Mixed-Integer Linear Programming

Bragin

Tucker

2022

Preprint

View full text Add to dashboard Cite

Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible solutions increases super-linearly thereby leading to a drastic increase in the computational effort. To efficiently solve MILP problems, a “price-based” decomposition and coordination approach is developed to exploit 1. the super-linear reduction of complexity upon the decomposition and 2. the geometric convergence potential inherent to Polyak’s step-sizing formula for the fastest coordination possible to obtain near-optimal solutions in a computationally efficient manner. Unlike all previous methods to set step-sizes heuristically by adjusting hyper-parameters, the key novel way to obtain step-sizes is purely decision-based: a novel “auxiliary” constraint satisfaction problem is solved, from which the appropriate step-sizes are inferred. Testing results for large-scale Generalized Assignment Problems (GAP) demonstrate that for the majority of instances, certifiably optimal solutions are obtained. For stochastic job-shop scheduling as well as for pharmaceutical scheduling, computational results demonstrate the two orders of magnitude speedup as compared to frequently used Branch-and-Cut (B&C). SLBLR has a major impact on the efficient resolution of complex Mixed-Integer Programming (MIP) problems arising within a variety of scientific fields.

show abstract

“…Although the delivery for medications has been increasingly implemented, based on the recent literature reviews, we found that only a few studies—for example, Fathollahi Fard et al 3 , Veenstra et al 6 , and Zhu and Ursavas 26 —have solved the logistics problem of medication delivery to determine the locations of potential facilities and the vehicle routing simultaneously. In this work, we extend the framework derived from Veenstra et al, 6 which investigates the joint facility location and VRP for medication delivery through lockers and customers’ homes.…”

Section: Discussionmentioning

confidence: 99%

“…They included two subpopulations derived from feasible solutions and infeasible solutions similar to the work by Yu et al 17 LRPs have been particularly applied in the real-world case with practical instances to increase efficient distribution networks and to increase competitiveness in the recent market. Some realworld case studies were presented by Veenstra et al 6 and Zhu and Ursavas, 26 which solved the LRP for the medication distribution in the Netherlands. The proposed model by Zhu and Ursavas 26 determined the facility and routing decisions simultaneously by considering three node types: depots, satellites, and customers.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Some real-world case studies were presented by Veenstra et al 6 and Zhu and Ursavas, 26 which solved the LRP for the medication distribution in the Netherlands. The proposed model by Zhu and Ursavas 26 determined the facility and routing decisions simultaneously by considering three node types: depots, satellites, and customers. They formulated and solved the problem by Lagrangian relaxation, branch and cut algorithm, and upper bound heuristic approach.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

On the medication distribution system for home health care through convenience stores, lockers, and home delivery

Suwatcharachaitiwong

Lin

Huang

et al. 2020

Health Informatics J

View full text Add to dashboard Cite

Medication distribution service can be delivered based on a combination of home delivery and customer pickup. That is, medications are delivered either to customers’ homes directly or to the pickup facilities (e.g. lockers) close to customers’ homes. In Taiwan, there are more than 11,000 convenience stores that provide a 24-h service for customers to pick up the ordered items from e-commerce, which is unique to the world. In the medication distribution system, convenience stores can provide a unique opportunity for customers to more conveniently collect medications at stores, and also can reduce the operating cost for a logistics company providing the medication delivery service. Therefore, this work proposes a medication distribution system through convenience stores, lockers, and home delivery. Under this system, this work investigates how to simultaneously determine employment of convenience store chains, the convenience store locations to be visited, locations of lockers, vehicle routes for convenience stores and lockers, and vehicle routes for customers’ homes, so that the total operating cost is minimized. This work further proposes a genetic algorithm to solve the medication distribution problem. Through simulation, the experimental results show that the proposed algorithm is able to solve the problem efficiently.

show abstract

Design and analysis of a satellite network with direct delivery in the pharmaceutical industry

Abstract: Take-down policy If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Cited by 21 publications

References 57 publications

Location Data Analytics in the Business Value Chain: A Systematic Literature Review

Location Data Analytics in the Business Value Chain: A Systematic Literature Review

Surrogate "Level-Based" Lagrangian Relaxation for Mixed-Integer Linear Programming

On the medication distribution system for home health care through convenience stores, lockers, and home delivery

Contact Info

Product

Resources

About