2,800 research outputs found

    A satellite navigation system to improve the management of intermodal drayage

    Get PDF
    The intermodal transport chain can become more efficient by means of a good organization of the drayage movements. Drayage in intermodal container terminals involves the pick up or delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the different vehicles, often with the presence of time windows. The literature shows some works on centralised drayage management, but most of them consider the problem only from a static and deterministic perspective, whereas the work we present here incorporates the knowledge of the real-time position of the vehicles, which permanently enables the planner to reassign tasks in case the problem conditions change. This exact knowledge of position of the vehicles is possible thanks to a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution

    Dynamic approach to solve the daily drayage problem with travel time uncertainty

    Get PDF
    The intermodal transport chain can become more e cient by means of a good organization of drayage movements. Drayage in intermodal container terminals involves the pick up and delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the di erent vehicles, often with the presence of time windows. This scheduling has traditionally been done once a day and, under these conditions, any unexpected event could cause timetable delays. We propose to use the real-time knowledge about vehicle position to solve this problem, which permanently allows the planner to reassign tasks in case the problem conditions change. This exact knowledge of the position of the vehicles is possible using a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution

    Dynamic programming algorithm for the vehicle routing problem with time windows and EC social legislation

    Get PDF
    In practice, apart from the problem of vehicle routing, schedulers also face the problem of nding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a dynamic programming approach for the vehicle routing problem with time windows including the EC social legislation on drivers' driving and working hours. Our algorithm includes all optional rules in these legislations, which are generally ignored in the literature. To include the legislation in the dynamic programming algorithm we propose a break scheduling method that does not increase the time-complexity of the algorithm. This is a remarkable eect that generally does not hold for local search methods, which have proved to be very successful in solving less restricted vehicle routing problems. Computational results show that our method finds solutions to benchmark instances with 18% less vehicles and 5% less travel distance than state of the art approaches. Furthermore, they show that including all optional rules of the legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5%\ud regarding the travel distance. Therefore, the optional rules should be exploited in practice

    Vehicle Routing with Traffic Congestion and Drivers' Driving and Working Rules

    Get PDF
    For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle’s departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicles routes, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments emonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible

    Performance Evaluation of Real-time Scheduling Approaches in Vehicle-based Internal Transport Systems

    Get PDF
    This paper studies the performance of static and real-time scheduling approaches in vehicle-based internal transport (VBIT) systems, which can be found in manufacturing and warehouse facilities. We propose three heuristic approaches for static VBIT problems (insertion, combined and column generation), extend them to a dynamic, real-time setting and compare their performance over a rolling time horizon. This time horizon can be seen either as a fixed-time interval in which advance information about loads’ arrivals is available, or as a fixed number of loads which are known to become available in the near future. We also propose two dynamic assignment approaches: with and without look-ahead, respectively. Performance (primarily average load waiting time) of the above five dynamic scheduling approaches is compared with two nearest-vehicle-first rules (with and without look-ahead), which are the best vehicle dispatching rules known from literature and which are commonly used in practice. Experimental results show that, if sufficient prior information is available, our dynamic scheduling approaches consistently outperform vehicle dispatching rules. Results also reveal that guide-path layout, load arrival rate and variance, and amount of load pre-arrival information have strong impacts on the performance of vehicle control approaches. Column generation or the combined heuristics are recommended in small or medium-scale VBIT systems, whereas for large scale VBIT systems, both the combined heuristic and the dynamic assignment approach with look ahead perform best

    On two-echelon inventory systems with Poisson demand and lost sales

    Get PDF
    We derive approximations for the service levels of two-echelon inventory systems with lost sales and Poisson demand. Our method is simple and accurate for a very broad range of problem instances, including cases with both high and low service levels. In contrast, existing methods only perform well for limited problem settings, or under restrictive assumptions.\u

    On green routing and scheduling problem

    Full text link
    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools
    • 

    corecore