4,727 research outputs found

    Comparison of Exact and Approximate methods for the Vehicle Routing Problem with Time Windows

    Get PDF
    This paper presents a comparison of two approaches for solving the vehicle routing problem with time windows (VRPTW). Scheduling of vehicles for pickup and delivery is a common problem in logistics and may be expressed as VRPTW, for which both exact and approximate techniques are available. It is therefore interesting to compare such techniques to evaluate their performance and figure what is the best option based on the instance features and size. In this work, we compared Mixed Integer Linear Programming (MILP) with Set-Based Particle Swarm optimization (S-PSO). Both algorithms are tested on the full 56 instances of the Solomon dataset. The results show that the two algorithms perform similarly for lower number of customers while there are significant differences for the cases with higher number of customers. For higher number of customers MILP consistently performs as good as or better than S-PSO for the clustered data, both with short and long scheduling horizons, while the S-PSO outperforms MILP in most cases with random and mixed random clustered data with long scheduling horizons. Furthermore when the algorithms perform the same with regards to the main objective (number of vehicles), MILP generally achieves a better result in the second objective (distance traveled)

    Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths

    Get PDF
    In this paper, the benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths is presented (AC-VRP-SPDVCFP). This problem is a specific multi-attribute variant of the well-known Vehicle Routing Problem, and it has been originally built for modelling and solving a real-world newspaper distribution problem with recycling policies. The whole benchmark is composed by 15 instances comprised by 50–100 nodes. For the design of this dataset, real geographical positions have been used, located in the province of Bizkaia, Spain. A deep description of the benchmark is provided in this paper, aiming at extending the details and experimentation given in the paper A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy (Osaba et al.) [1]. The dataset is publicly available for its use and modification.Eneko Osaba would like to thank the Basque Government for its funding support through the EMAITEK and ELKARTEK

    On the use of biased-randomized algorithms for solving non-smooth optimization problems

    Get PDF
    Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines

    A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows

    Full text link
    The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results are presented for different classes of vehicle routing problems, varying in their coverage with time windows, time window size, distribution and number of customers. The results are compared with a simple, but effective local search approach for multi-objective combinatorial optimization problems

    Hybrid Metaheuristics for the Clustered Vehicle Routing Problem

    Get PDF
    The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This article presents two alternative hybrid metaheuristic algorithms for the CluVRP. The first algorithm is based on an Iterated Local Search algorithm, in which only feasible solutions are explored and problem-specific local search moves are utilized. The second algorithm is a Hybrid Genetic Search, for which the shortest Hamiltonian path between each pair of vertices within each cluster should be precomputed. Using this information, a sequence of clusters can be used as a solution representation and large neighborhoods can be efficiently explored by means of bi-directional dynamic programming, sequence concatenations, by using appropriate data structures. Extensive computational experiments are performed on benchmark instances from the literature, as well as new large scale ones. Recommendations on promising algorithm choices are provided relatively to average cluster size.Comment: Working Paper, MIT -- 22 page

    Heliostat field cleaning scheduling for Solar Power Tower plants: a heuristic approach

    Get PDF
    Soiling of heliostat surfaces due to local climate has a direct impact on their optical efficiency and therefore a direct impact on the productivity of the Solar Power Tower plant. Cleaning techniques applied are dependent on plant construction and current schedules are normally developed considering heliostat layout patterns, providing sub-optimal results. In this paper, a method to optimise cleaning schedules is developed, with the objective of maximising energy generated by the plant. First, an algorithm finds a cleaning schedule by solving an integer program, which is then used as a starting solution in an exchange heuristic. Since the optimisation problems are of large size, a p-median type heuristic is performed to reduce the problem dimensionality by clustering heliostats into groups to be cleaned in the same period.Ministerio de Economía y Competitivida

    The Vehicle Routing Problem with Divisible Deliveries and Pickups

    Get PDF
    The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits. The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup and delivery quantities to be served separately with respect to the case where the quantities have to be served simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem structure and an average estimation of the savings due to the possibility of serving pickup and delivery quantities separately
    corecore