842 research outputs found
The k-metric dimension of a graph
As a generalization of the concept of a metric basis, this article introduces
the notion of -metric basis in graphs. Given a connected graph , a
set is said to be a -metric generator for if the elements
of any pair of different vertices of are distinguished by at least
elements of , i.e., for any two different vertices , there exist
at least vertices such that for every . A metric generator of minimum
cardinality is called a -metric basis and its cardinality the -metric
dimension of . A connected graph is -metric dimensional if is the
largest integer such that there exists a -metric basis for . We give a
necessary and sufficient condition for a graph to be -metric dimensional and
we obtain several results on the -metric dimension
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
The non-smooth and bi-objective team orienteering problem with soft constraints
In the classical team orienteering problem (TOP), a fixed fleet of vehicles is employed, each of them with a limited driving range. The manager has to decide about the subset of customers to visit, as well as the visiting order (routes). Each customer offers a different reward, which is gathered the first time that it is visited. The goal is then to maximize the total reward collected without exceeding the driving range constraint. This paper analyzes a more realistic version of the TOP in which the driving range limitation is considered as a soft constraint: every time that this range is exceeded, a penalty cost is triggered. This cost is modeled as a piece-wise function, which depends on factors such as the distance of the vehicle to the destination depot. As a result, the traditional reward-maximization objective becomes a non-smooth function. In addition, a second objective, regarding the design of balanced routing plans, is considered as well. A mathematical model for this non-smooth and bi-objective TOP is provided, and a biased-randomized algorithm is proposed as a solving approach. © 2020 by the authors.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness & FEDER (SEV-2015-0563), the Spanish Ministry of Science (PID2019-111100RB-C21, RED2018-102642-T), and the Erasmus+ Program (2019-I-ES01-KA103-062602)
- …