16,104 research outputs found
Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach
In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version
Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach
In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version
Ambulance Emergency Response Optimization in Developing Countries
The lack of emergency medical transportation is viewed as the main barrier to
the access of emergency medical care in low and middle-income countries
(LMICs). In this paper, we present a robust optimization approach to optimize
both the location and routing of emergency response vehicles, accounting for
uncertainty in travel times and spatial demand characteristic of LMICs. We
traveled to Dhaka, Bangladesh, the sixth largest and third most densely
populated city in the world, to conduct field research resulting in the
collection of two unique datasets that inform our approach. This data is
leveraged to develop machine learning methodologies to estimate demand for
emergency medical services in a LMIC setting and to predict the travel time
between any two locations in the road network for different times of day and
days of the week. We combine our robust optimization and machine learning
frameworks with real data to provide an in-depth investigation into three
policy-related questions. First, we demonstrate that outpost locations
optimized for weekday rush hour lead to good performance for all times of day
and days of the week. Second, we find that significant improvements in
emergency response times can be achieved by re-locating a small number of
outposts and that the performance of the current system could be replicated
using only 30% of the resources. Lastly, we show that a fleet of small
motorcycle-based ambulances has the potential to significantly outperform
traditional ambulance vans. In particular, they are able to capture three times
more demand while reducing the median response time by 42% due to increased
routing flexibility offered by nimble vehicles on a larger road network. Our
results provide practical insights for emergency response optimization that can
be leveraged by hospital-based and private ambulance providers in Dhaka and
other urban centers in LMICs
Scaling and entropy in p-median facility location along a line
The p-median problem is a common model for optimal facility location. The
task is to place p facilities (e.g., warehouses or schools) in a
heterogeneously populated space such that the average distance from a person's
home to the nearest facility is minimized. Here we study the special case where
the population lives along a line (e.g., a road or a river). If facilities are
optimally placed, the length of the line segment served by a facility is
inversely proportional to the square root of the population density. This
scaling law is derived analytically and confirmed for concrete numerical
examples of three US Interstate highways and the Mississippi River. If facility
locations are permitted to deviate from the optimum, the number of possible
solutions increases dramatically. Using Monte Carlo simulations, we compute how
scaling is affected by an increase in the average distance to the nearest
facility. We find that the scaling exponents change and are most sensitive near
the optimum facility distribution.Comment: 7 pages, 6 figures, Physical Review E, in pres
Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach
Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution
- …