77 research outputs found
CVRP with sequence based pallet loading and axle weight restrictions with and without dense packing
Abstract This paper presents an Iterated Local Search (ILS) for the CVRP with sequence based pallet loading and axle weight restrictions with and without dense packing. The problem deals with the distribution of pallets to different locations while taking into account that items may not be shifted during the trip and that axle weight limits need to be respected. The structure of the metaheuristic as well as preliminary results will be discussed
Distance Approximation for Dynamic Waste Collection Planning
Approximating the solution value of transportation problems has become more relevant in recent years, as these approximations can help to decrease the computational eort required for solving those routing problems. In this paper, we apply several regression methods to predict the total distance of the traveling salesman problem (TSP) and vehicle routing problem (VRP). We show that distance can be estimated fairly accurately using simple regression models and only a limited number of features. We use features found in scientific literature and introduce a new class of geographical features. The model is validated on a dynamic waste collection case in the city of Amsterdam, The Netherlands. We introduce a cost function that combines the travel distance and service level, and show that our model can reduce distances up to 17%, while maintaining the same service level, compared to a well-known heuristic approximation. Furthermore, we show the benefits of using approximations for combining oine learning with online or frequent optimization
WOSMIP II- Workshop on Signatures of Medical and Industrial Isotope Production
Medical and industrial fadioisotopes are fundamental tools used in science, medicine and industry with an ever expanding usage in medical practice where their availability is vital. Very sensitive environmental radionuclide monitoring networks have been developed for nuclear-security-related monitoring [particularly Comprehensive Test-Ban-Treaty (CTBT) compliance verification] and are now operational
The vehicle routing problem: state of the art classification and review
Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever more popular in the academic literature. Yet, the problem characteristics and assumptions vary widely and few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the VRP literature published between 2009 and June 2015. Based on an adapted version of an existing comprehensive taxonomy, we classify 277 articles and analyze the trends in the VRP literature. This classification is the first to categorize the articles to this level of detail.publisher: Elsevier
articletitle: The vehicle routing problem: State of the art classification and review
journaltitle: Computers & Industrial Engineering
articlelink: http://dx.doi.org/10.1016/j.cie.2015.12.007
content_type: article
copyright: © 2015 Elsevier Ltd. All rights reserved.status: publishe
A Model for the Coordination of 20-foot and 40-foot Container Movements in the Hinterland of a Container Terminal
Stochastic programming model for integrating bus network design and dial-a-ride scheduling
Designing efficient order picking systems: the effect of real-life features on the relationship among planning problems
The Fleet Size and Mix Vehicle Routing Problem with sequence-based pallet loading and axle weight constraints
In this paper, the Fleet Size and Mix Vehicle Routing Problem (FSM) with sequence-based pallet loading and axle weight constraints is introduced. The effect of the integration of axle weight constraints in a FSM is analyzed by comparing the FSM with and without axle weight constraints. A vehicle fleet of 30-foot and 45-foot trucks, consisting of a tractor and a semi-trailer, is considered. Furthermore, two scenarios are analyzed for which the objective function differs: in the first scenario the objective is to minimize total distance while in the second scenario the objective is the minimization of total transport costs. An Iterated Local Search metaheuristic algorithm is used to tackle the problem. The results indicate that the vehicle fleet strongly influences the impact of the integration of axle weight constraints on solution cost. Furthermore, the analysis points out that fleet size and mix decisions may be influenced by the integration of axle weight constraints
The impact of axle weight constraints on the deployment of a mixed-fleet in vehicle routing decisions
peer reviewedA vehicle routing problem (VRP), using a mixed fleet of vehicles, with sequence-based pallet loading and axle weight constraints is introduced. The effect of the integration of axle weight constraints in a Fleet Size and Mix VRP is analyzed by comparing the problem with and without axle weight constraints. A vehicle fleet of 30-foot and 45-foot trucks, consisting of a tractor and a semi-trailer, is considered. Two scenarios are analyzed with different objective functions. In the first scenario, the objective aims to minimize total distance while in the second scenario the objective aims the minimization of total transport costs. An Iterated Local Search metaheuristic algorithm is used to solve the problem. The results indicate that the impact of axle weight constraints on the solution cost of a vehicle routing problem depends on the fleet composition. Therefore, decisions on the deployment of a mixed-size fleet may be influenced by the integration of axle weight constraints
- …