146 research outputs found
The split delivery capacitated team orienteering problem
In this article, we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each route and the vehicle capacity constraints. When split deliveries are allowed, each customer may be served by more than one vehicle. We show that the profit collected by allowing split deliveries may be as large as twice the profit collected under the constraint that each customer has to be served by one vehicle at most. We then present a branch-and-price exact algorithm and a hybrid heuristic. We show the effectiveness of the proposed approaches on benchmark instances and on a new set of instances that allow us to computationally evaluate the impact of split deliveries
The Vehicle Routing Problem with Service Level Constraints
We consider a vehicle routing problem which seeks to minimize cost subject to
service level constraints on several groups of deliveries. This problem
captures some essential challenges faced by a logistics provider which operates
transportation services for a limited number of partners and should respect
contractual obligations on service levels. The problem also generalizes several
important classes of vehicle routing problems with profits. To solve it, we
propose a compact mathematical formulation, a branch-and-price algorithm, and a
hybrid genetic algorithm with population management, which relies on
problem-tailored solution representation, crossover and local search operators,
as well as an adaptive penalization mechanism establishing a good balance
between service levels and costs. Our computational experiments show that the
proposed heuristic returns very high-quality solutions for this difficult
problem, matches all optimal solutions found for small and medium-scale
benchmark instances, and improves upon existing algorithms for two important
special cases: the vehicle routing problem with private fleet and common
carrier, and the capacitated profitable tour problem. The branch-and-price
algorithm also produces new optimal solutions for all three problems
Distribution with Quality of Service Considerations:The Capacitated Routing Problem with Profits and Service Level Requirements
Inspired by a problem arising in cash logistics, we propose the Capacitated Routing Problem with Profits and Service Level Requirements (CRPPSLR). The CRPPSLR extends the class of Routing Problems with Profits by considering customers requesting deliveries to their (possibly multiple) service points. Moreover, each customer imposes a service level requirement specifying a minimum-acceptable bound on the fraction of its service points being delivered. A customer-specific financial penalty is incurred by the logistics service provider when this requirement is not met. The CRPPSLR consists in finding vehicle routes maximizing the difference between the collected revenues and the incurred transportation and penalty costs in such a way that vehicle capacity and route duration constraints are met. A fleet of homogeneous vehicles is available for serving the customers. We design a branch-and-cut algorithm and evaluate the usefulness of valid inequalities that have been effectively used for the capacitated vehicle routing problem and, more recently, for other routing problems with profits. A real-life case study taken from the cash supply chain in the Netherlands highlights the relevance of the problem under consideration. Computational results illustrate the performance of the proposed solution approach under different input parameter settings for the synthetic instances. For instances of real-life problems, we distinguish between coin and banknote distribution, as vehicle capacities only matter when considering the former. Finally, we report on the effectiveness of the valid inequalities in closing the optimality gap at the root node for both the synthetic and the real-life instances and conclude with a sensitivity analysis on the most significant input parameters of our model
Arc routing problems: A review of the past, present, and future
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applicationsThis research was supported by the Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional, Grant/Award Number: PGC2018-099428-B-I00. The Research Council of Norway, Grant/Award Numbers: 246825/O70 (DynamITe), 263031/O70 (AXIOM).Corberán, Á.; Eglese, R.; Hasle, G.; Plana, I.; Sanchís Llopis, JM. (2021). Arc routing problems: A review of the past, present, and future. Networks. 77(1):88-115. https://doi.org/10.1002/net.21965S8811577
An updated annotated bibliography on arc routing problems
The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post-disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising.info:eu-repo/semantics/publishedVersio
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
Mathematical formulations and optimization algorithms for solving rich vehicle routing problems.
Objectives and methods of study: The main objective of this work is to analyze and solve three different rich selective Vehicle Routing Problems (VRPs). The first problem is a bi-objective variant of the well-known Traveling Purchaser Problem (TPP) in which the purchased products are delivered to customers. This variant aims to find a route for which the total cost (transportation plus purchasing costs) and the sum of the customers’s waiting time are simultaneously minimized. A mixed integer bi-objective programming formulation of the problem is presented and tested with CPLEX 12.6 within an ǫ-constraint framework which fails to find non-dominated solutions for instances containing more than 10 nodes. Therefore, a heuristic based on relinked local search and Variable Neighborhood Search (VNS) is proposed to approximate the Pareto front for large instances. The proposed heuristic was tested over a large set of artificial instances of the problem. Computational results over small-sized instances show that the heuristic is competitive with the ǫ-constraint method. Also, computational tests over large-sized instances were carried out in order to study how the characteristics of the instances impact the algorithm performance. The second problem consists of planning a selective delivery schedule of multiple products. The problem is modeled as a multi-product split delivery capacitated team orienteering problem with incomplete services, and soft time windows. The problem is modeled through a mixed integer linear programming formulation and approximated by means of a multi-start Adaptive Large Neighborhood Search (ALNS) metaheuristic. Computational results show that the multi-start metaheuristic reaches better results than its classical implementation in which a single solution is build and then improved. Finally, an Orienteering Problem (OP) with mandatory visits and conflicts, is formulated through five mixed integer linear programming models. The main difference among them lies in the way they handle the subtour elimination constraints. The models were tested over a large set of instances of the problem. Computational experiments reveal that the model which subtour elimination constraints are based on a single-commodity flow formulation allows CPLEX 12.6 to obtain the optimal solution for more instances than the other formulations within a given computation time limit. Contributions: The main contributions of this thesis are: • The introduction of the bi-objective TPP with deliveries since few bi-objective versions of the TPP have been studied in the literature. Furthermore, to the best of our knowledge, there is only one more work that takes into account deliveries in a TPP. • The design and implementation of a hybrid heuristic based on relinked local search and VNS to solve the bi-objective TPP with deliveries. Additionally, we provide guidelines for the application of the heuristic when different characteristics of the instances are observed. • The design and implementation of a multi-start adaptive large neighborhood search to solve a selective delivery schedule problem. • The experimental comparison among different formulations for an OP with mandatory nodes and conflicts
- …