702 research outputs found
Distributed Services with Foreseen and Unforeseen Tasks: The Mobile Re-allocation Problem
In this paper we deal with a common problem found in the operations of security and preventive/corrective maintenance services: that of routing a number of mobile resources to serve foreseen and unforeseen tasks during a shift. We define the (Mobile Re-Allocation Problem) MRAP as the problem of devising a routing strategy to maximize the expected weighted number of tasks served on time. For obtaining a solution to the MRAP, we propose to solve successively a multi-objective optimization problem called the stochastic Team Orienteering Problem with Multiple Time Windows (s-TOP-MTW) so as to consider information about known tasks and the arrival process of new unforeseen tasks. Solving successively the s-TOP-MTW we find that considering information about the arrival process of new unforeseen tasks may aid in maximizing the expected proportion of tasks accomplished on time.location;reliability;routing;distributed services
Recommended from our members
Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art
Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP
The stochastic team orienteering problem with position-dependent rewards
In this paper, we analyze both the deterministic and stochastic versions of a team orienteering problem (TOP) in which rewards from customers are dynamic. The typical goal of the TOP is to select a set of customers to visit in order to maximize the total reward gathered by a fixed fleet of vehicles. To better reflect some real-life scenarios, we consider a version in which rewards associated with each customer might depend upon the order in which the customer is visited within a route, bonusing the first clients and penalizing the last ones. In addition, travel times are modeled as random variables. Two mixed-integer programming models are proposed for the deterministic version, which is then solved using a well-known commercial solver. Furthermore, a biased-randomized iterated local search algorithm is employed to solve this deterministic version. Overall, the proposed metaheuristic algorithm shows an outstanding performance when compared with the optimal or near-optimal solutions provided by the commercial solver, both in terms of solution quality as well as in computational times. Then, the metaheuristic algorithm is extended into a full simheuristic in order to solve the stochastic version of the problem. A series of numerical experiments allows us to show that the solutions provided by the simheuristic outperform the near-optimal solutions obtained for the deterministic version of the problem when the latter are used in a scenario under conditions of uncertainty. In addition, the solutions provided by our simheuristic algorithm for the stochastic version of the problem offer a higher reliability level than the ones obtained with the commercial solver.Peer ReviewedPostprint (published version
Electric vehicle routing, arc routing, and team orienteering problems in sustainable transportation
[EN] The increasing use of electric vehicles in road and air transportation, especially in last-mile delivery and city mobility, raises new operational challenges due to the limited capacity of electric batteries. These limitations impose additional driving range constraints when optimizing the distribution and mobility plans. During the last years, several researchers from the Computer Science, Artificial Intelligence, and Operations Research communities have been developing optimization, simulation, and machine learning approaches that aim at generating efficient and sustainable routing plans for hybrid fleets, including both electric and internal combustion engine vehicles. After contextualizing the relevance of electric vehicles in promoting sustainable transportation practices, this paper reviews the existing work in the field of electric vehicle routing problems. In particular, we focus on articles related to the well-known vehicle routing, arc routing, and team orienteering problems. The review is followed by numerical examples that illustrate the gains that can be obtained by employing optimization methods in the aforementioned field. Finally, several research opportunities are highlighted.This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21-C22/AEI/10.13039/501100011033, RED2018-102642-T), the SEPIE Erasmus+Program (2019-I-ES01-KA103-062602), and the IoF2020-H2020 (731884) project.Do C. Martins, L.; Tordecilla, RD.; Castaneda, J.; Juan-PĂ©rez, ĂA.; Faulin, J. (2021). Electric vehicle routing, arc routing, and team orienteering problems in sustainable transportation. Energies. 14(16):1-30. https://doi.org/10.3390/en14165131130141
Operator Selection in Adaptive Large Neighborhood Search using Deep Reinforcement Learning
Large Neighborhood Search (LNS) is a popular heuristic for solving
combinatorial optimization problems. LNS iteratively explores the neighborhoods
in solution spaces using destroy and repair operators. Determining the best
operators for LNS to solve a problem at hand is a labor-intensive process.
Hence, Adaptive Large Neighborhood Search (ALNS) has been proposed to
adaptively select operators during the search process based on operator
performances of the previous search iterations. Such an operator selection
procedure is a heuristic, based on domain knowledge, which is ineffective with
complex, large solution spaces. In this paper, we address the problem of
selecting operators for each search iteration of ALNS as a sequential decision
problem and propose a Deep Reinforcement Learning based method called Deep
Reinforced Adaptive Large Neighborhood Search. As such, the proposed method
aims to learn based on the state of the search which operation to select to
obtain a high long-term reward, i.e., a good solution to the underlying
optimization problem. The proposed method is evaluated on a time-dependent
orienteering problem with stochastic weights and time windows. Results show
that our approach effectively learns a strategy that adaptively selects
operators for large neighborhood search, obtaining competitive results compared
to a state-of-the-art machine learning approach while trained with much fewer
observations on small-sized problem instances
- âŠ