Search results for "Automation"
showing 10 items of 1181 documents
Communal Transportation: Challenges for Largescale Routing Heuristics
2007
In this report we review the central transportation logistics problems arising in the communal sector, using information gathered from several large communes in Finland and previous literature. Most of the communal transportation problems can be modelled as different variants of the vehicle routing problem. The basic features of the problems are described, modelled and analyzed, and the relevant previous research on the topics is reviewed. In addition, some possible new solution strategies are suggested.
Optimal Transit Network Design
2019
In this chapter, the optimal transit network design is under investigation. A special kind of transport is assumed to be given the best traffic conditions in a road network (the smallest amount of travel time between origins and destinations). Optimality criteria for transit network design in case of selfish routing are defined in the first section. The Sect. 7.2 is devoted to the estimation of selfish traffic assignment in a network with a transit subnetwork. Optimality criteria for transit network design in case of competitive drivers’ groups routing are defined in the Sect. 7.3. The Sect. 7.4 is devoted to traffic assignment in case of competitive drivers’ groups routing in a network wit…
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
2011
Abstract: The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
Expansive Voronoi Tree: A Motion Planner for Assembly Sequence Planning
2021
One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find an appropriate disassembly path for each assembled part. Complex real-world scenes are characterized by a large installation space. There each part has many different possible disassembly paths that differ in length and clearance. However, due to tight packing in the installation space, these paths can contain narrow passages. Therefore a motion planner is needed that is able to globally search for a reasonable path and to locally overcome narrow passages. Moreover, since motion planning requests are executed in the ASP context over and over again for many parts, both for those that can b…
Solving a large multicontainer loading problem in the car manufacturing industry
2017
Abstract Renault, a large car manufacturer with factories all over the world, has a production system in which not every factory produces all the parts required to assemble a vehicle. Every day, large quantities of car parts are sent from one factory to another, defining very large truck/container transportation problems. The main challenge faced by the Renault logistics platforms is to load the items into trucks and containers as efficiently as possible so as to minimize the number of vehicles sent. Therefore, the problem to be solved is a multicontainer loading problem in which, besides the usual geometric constraints preventing items from overlapping and exceeding the dimensions of the c…
Bidirectional labeling for solving vehicle routing and truck driver scheduling problems
2020
Abstract This paper studies the vehicle routing and truck driver scheduling problem where routes and schedules must comply with hours of service regulations for truck drivers. It presents a backward labeling method for generating feasible schedules and shows how the labels generated with the backward method can be combined with labels generated by a forward labeling method. The bidirectional labeling is embedded into a branch-and-price-and-cut approach and evaluated for hours of service regulations in the United States and the European Union. Computational experiments show that the resulting bidirectional branch-and-price-and-cut approach is significantly faster than unidirectional counterp…
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
2016
International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…
Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows
2018
In this paper, we present a new branch-and-price-and-cut algorithm to solve the truck-and-trailer routing problem with time windows (TTRPTW) and two real-world extensions. In all TTRPTW variants, the fleet consists of one or more trucks that may attach a trailer. Some customers are not accessible with a truck-and-trailer combination, but can however be serviced by one if the trailer is previously detached and parked at a suitable location. In the first extension, the planning horizon comprises two days and customers may be visited either on both days or only once, in which case twice the daily supply must be collected. The second extension incorporates load transfer times depending on the …
Acceptance of truck platooning by professional drivers on German highways. A mixed methods approach.
2020
Abstract Truck platoon driving is a current branch of automated driving, which has the potential to radically change the work routine of professional drivers. In a platoon system, one truck (semi-)automatically follows a lead truck with a reduced distance, which produces significant savings in fuel and enables better traffic flow. In a current application of truck platoon driving, the following vehicle operates at level-2 automation. Thus, the driver of the following truck merely has to supervise the semi-automated system, which takes over steering and speed control when engaged. Level-2 truck platoon driving had not been tested with professional drivers in real traffic before. We hypothesi…
Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport
2013
AbstractThis paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-distance road transport in Europe: Pickup-and-delivery requests have to be fulfilled over a multi-period planning horizon by a heterogeneous fleet of trucks and drivers. Typically, in the vehicle routing literature, a fixed assignment of a driver to a truck is assumed. In our approach, we abandon this assumption and allow truck/driver changes at geographically dispersed relay stations. This offers greater planning flexibility and allows a better utilization of trucks, but also creates intricate interdependencies between trucks and drivers and requires the synchronization of their routes…