40 research outputs found
A matheuristic for the Team Orienteering Arc Routing Problem
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit.
A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint.
The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances
for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances
(with up to 27 vertices and 296 arcs). The average error on all instances fo rwhich the optimal solution is available is 0.67 percent.Angel Corberan, Isaac Plana and Jose M. Sanchis wish to thank the Ministerio de Economia y Competitividad (project MTM2012-36163-C06-02) of Spain and the Generalitat Valenciana (project GVPROMETEO2013-049) for their support.Archetti, C.; Corberan, A.; Plana, I.; Sanchís Llopis, JM.; Speranza, MG. (2015). A matheuristic for the Team Orienteering Arc Routing Problem. European Journal of Operational Research. 245(2):392-401. https://doi.org/10.1016/j.ejor.2015.03.022S392401245
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified.
In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be
serviced, a set of potential customers is available. From this latter set, customers have to be chosen on
the basis of an associated profit. The objective is to find a route servicing the customers which maximize
the total profit collected while satisfying a given time limit on the route.In this paper, we describe large
families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its
solution. The exact algorithm embeds a procedure which builds a heuristic solution to the OARP on the
basis of the information provided by the solution of the linear relaxation. Extensive computational
experiments over different sets of OARP instances show that the exact algorithm is capable of solving to
optimality large instances, with up to 2000 vertices and 14,000 arcs, within 1 h and often within a few minutes.Authors want to thank two anonymous referees for their careful reading of the original paper and their many valuable comments and suggestions that have helped to improve the paper. Angel Corberan, Isaac Plana and Jose M. Sanchis wish to thank the Ministerio de Economia y Competitividad of Spain (MTM2012-36163-006-02) and the Generalitat Valenciana (project GVPR-OMETE02013-049) for its support.Archetti, C.; Corberán, A.; Plana, I.; Sanchís Llopis, JM.; Speranza, M. (2016). A branch-and-cut algorithm for the Orienteering Arc Routing Problem. Computers & Operations Research. 66:95-104. https://doi.org/10.1016/j.cor.2015.08.003S951046
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