81 research outputs found

    The Vehicle Routing Problem with Service Level Constraints

    Full text link
    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

    A multi-criteria decision support system for a routing problem in waste collection

    Get PDF
    Autor proofThis work presents a decision support system for route planning of vehicles performing waste collection for recycling. We propose a prototype system that includes three modules: route optimization, waste generation prediction, and multiple-criteria decision analysis (MCDA). In this work we focus on the application of MCDA in route optimization. The structure and functioning of the DSS is also presented. We modelled the waste collection procedure as a routing problem, more specifically as a team orienteering problem with capacity constraints and time windows. To solve the route optimization problem we developed a cellular genetic algorithm. For the MCDA module, we employed three methods: SMART, ValueFn and Analytic Hierarchy Process (AHP). The decision support system was tested with real-world data from a waste management company that collects recyclables, and the capabilities of the system are discussed.FCT Fundação para a Ciência e Tecnologia, Project Scope: PEst-OE/EEI/UI0319/2

    Modelo Matemático e Meta-Heurística Simulated Annealing para Elaboração de Roteiros Turísticos com base no Tourist Trip Design Problem

    Get PDF
    Muito embora existam diversos pacotes de viagens com destinos predefinidos contemplando locais mais populares, nos últimos anos tem crescido a procura por soluções que criem roteiros personalizados voltados às necessidades de cada turista. Para suprir essa nova demanda surge o Problema de Elaboração de Rotas Turísticas (PERT) ou TouristTrip Design Problem (TTDP) o qual Van Oudheusden e Vansteenwegen (2007) sugerem o uso do OrienteeringProblem (OP) e suas extensões para resolução desta classe de problemas. Esta dissertação tem por objetivo o desenvolvimento de um modelo matemático e de uma meta-heurística SimulatedAnnealing (SA) para resolução do TouristTrip Design Problem (TTDP)

    Mathematical formulations and optimization algorithms for solving rich vehicle routing problems.

    Get PDF
    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

    The time-dependent capacitated profitable tour problem with time windows and precedence constraints

    Get PDF
    We introduce the time-dependent capacitated profitable tour problem with time windows and precedence constraints. This problem concerns determining a tour and its departure time at the depot that maximizes the collected profit minus the total travel cost (measured by total travel time). To deal with road congestion, travel times are considered to be time-dependent. We develop a tailored labeling algorithm to find the optimal tour. Furthermore, we introduce dominance criteria to discard unpromising labels. Our computational results demonstrate that the algorithm is capable of solving instances with up to 150 locations (75 pickup and delivery requests) to optimality. Additionally, we present a restricted dynamic programing heuristic to improve the computation time. This heuristic does not guarantee optimality, but is able to find the optimal solution for 32 instances out of the 34 instances

    Arc routing problems: A review of the past, present, and future

    Full text link
    [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

    Line Coverage with Multiple Robots: Algorithms and Experiments

    Full text link
    The line coverage problem involves finding efficient routes for the coverage of linear features by one or more resource-constrained robots. Linear features model environments like road networks, power lines, and oil and gas pipelines. Two modes of travel are defined for robots: servicing and deadheading. A robot services a feature if it performs task-specific actions, such as taking images, as it traverses the feature; otherwise, it is deadheading. Traversing the environment incurs costs (e.g., travel time) and demands on resources (e.g., battery life). Servicing and deadheading can have different cost and demand functions, which can be direction-dependent. The environment is modeled as a graph, and an integer linear program is provided. As the problem is NP-hard, we design a fast and efficient heuristic algorithm, Merge-Embed-Merge (MEM). Exploiting the constructive property of the MEM algorithm, algorithms for line coverage of large graphs with multiple depots are developed. Furthermore, turning costs and nonholonomic constraints are efficiently incorporated into the algorithm. The algorithms are benchmarked on road networks and demonstrated in experiments with aerial robots.Comment: The paper will appear in the IEEE Transactions on Robotic

    Orienteering Problem: A survey of recent variants, solution approaches and applications

    Get PDF
    National Research Foundation (NRF) Singapore under International Research Centres in Singapore Funding Initiativ

    Two-Stage Vehicle Routing Problems with Profits and Buffers: Analysis and Metaheuristic Optimization Algorithms

    Get PDF
    This thesis considers the Two-Stage Vehicle Routing Problem (VRP) with Profits and Buffers, which generalizes various optimization problems that are relevant for practical applications, such as the Two-Machine Flow Shop with Buffers and the Orienteering Problem. Two optimization problems are considered for the Two-Stage VRP with Profits and Buffers, namely the minimization of total time while respecting a profit constraint and the maximization of total profit under a budget constraint. The former generalizes the makespan minimization problem for the Two-Machine Flow Shop with Buffers, whereas the latter is comparable to the problem of maximizing score in the Orienteering Problem. For the three problems, a theoretical analysis is performed regarding computational complexity, existence of optimal permutation schedules (where all vehicles traverse the same nodes in the same order) and potential gaps in attainable solution quality between permutation schedules and non-permutation schedules. The obtained theoretical results are visualized in a table that gives an overview of various subproblems belonging to the Two-Stage VRP with Profits and Buffers, their theoretical properties and how they are connected. For the Two-Machine Flow Shop with Buffers and the Orienteering Problem, two metaheuristics 2BF-ILS and VNSOP are presented that obtain favorable results in computational experiments when compared to other state-of-the-art algorithms. For the Two-Stage VRP with Profits and Buffers, an algorithmic framework for Iterative Search Algorithms with Variable Neighborhoods (ISAVaN) is proposed that generalizes aspects from 2BF-ILS as well as VNSOP. Various algorithms derived from that framework are evaluated in an experimental study. The evaluation methodology used for all computational experiments in this thesis takes the performance during the run time into account and demonstrates that algorithms for structurally different problems, which are encompassed by the Two-Stage VRP with Profits and Buffers, can be evaluated with similar methods. The results show that the most suitable choice for the components in these algorithms is dependent on the properties of the problem and the considered evaluation criteria. However, a number of similarities to algorithms that perform well for the Two-Machine Flow Shop with Buffers and the Orienteering Problem can be identified. The framework unifies these characteristics, providing a spectrum of algorithms that can be adapted to the specifics of the considered Vehicle Routing Problem.:1 Introduction 2 Background 2.1 Problem Motivation 2.2 Formal Definition of the Two-Stage VRP with Profits and Buffers 2.3 Review of Literature on Related Vehicle Routing Problems 2.3.1 Two-Stage Vehicle Routing Problems 2.3.2 Vehicle Routing Problems with Profits 2.3.3 Vehicle Routing Problems with Capacity- or Resource-based Restrictions 2.4 Preliminary Remarks on Subsequent Chapters 3 The Two-Machine Flow Shop Problem with Buffers 3.1 Review of Literature on Flow Shop Problems with Buffers 3.1.1 Algorithms and Metaheuristics for Flow Shops with Buffers 3.1.2 Two-Machine Flow Shop Problems with Buffers 3.1.3 Blocking Flow Shops 3.1.4 Non-Permutation Schedules 3.1.5 Other Extensions and Variations of Flow Shop Problems 3.2 Theoretical Properties 3.2.1 Computational Complexity 3.2.2 The Existence of Optimal Permutation Schedules 3.2.3 The Gap Between Permutation Schedules an Non-Permutation 3.3 A Modification of the NEH Heuristic 3.4 An Iterated Local Search for the Two-Machine Flow Shop Problem with Buffers 3.5 Computational Evaluation 3.5.1 Algorithms for Comparison 3.5.2 Generation of Problem Instances 3.5.3 Parameter Values 3.5.4 Comparison of 2BF-ILS with other Metaheuristics 3.5.5 Comparison of 2BF-OPT with NEH 3.6 Summary 4 The Orienteering Problem 4.1 Review of Literature on Orienteering Problems 4.2 Theoretical Properties 4.3 A Variable Neighborhood Search for the Orienteering Problem 4.4 Computational Evaluation 4.4.1 Measurement of Algorithm Performance 4.4.2 Choice of Algorithms for Comparison 4.4.3 Problem Instances 4.4.4 Parameter Values 4.4.5 Experimental Setup 4.4.6 Comparison of VNSOP with other Metaheuristics 4.5 Summary 5 The Two-Stage Vehicle Routing Problem with Profits and Buffers 5.1 Theoretical Properties of the Two-Stage VRP with Profits and Buffers 5.1.1 Computational Complexity of the General Problem 5.1.2 Existence of Permutation Schedules in the Set of Optimal Solutions 5.1.3 The Gap Between Permutation Schedules an Non-Permutation Schedules 5.1.4 Remarks on Restricted Cases 5.1.5 Overview of Theoretical Results 5.2 A Metaheuristic Framework for the Two-Stage VRP with Profits and Buffers 5.3 Experimental Results 5.3.1 Problem Instances 5.3.2 Experimental Results for O_{max R, Cmax≤B} 5.3.3 Experimental Results for O_{min Cmax, R≥Q} 5.4 Summary Bibliography List of Figures List of Tables List of Algorithm
    corecore