The Experts below are selected from a list of 138942 Experts worldwide ranked by ideXlab platform
Christoph Manuel Meyer - One of the best experts on this subject based on the ideXlab platform.
-
Model for the Vehicle Routing Problem with Time Windows and European Social Legislation
Vehicle Routing under Consideration of Driving and Working Hours, 2011Co-Authors: Christoph Manuel MeyerAbstract:In this chapter the problem of combined vehicle routing and break scheduling is investigated from a central planning perspective.5 The problem of combined vehicle routing and break scheduling is defined as the problem of finding vehicle routes to service a set of transportation requests such that a cost criterion is minimized and legal rules on driving and working hours are observed (Meyer et al., 2010). This definition allows for different underlying vehicle routing problems such as the VRP, the VRPTW, the Pickup and Delivery Problem (PDP) or the Pickup and Delivery Problem with Time Windows (PDPTW). Moreover, different sets of legal rules can be considered such as the US regulations set by the DOT or the European Social Legislation.
-
European Legislation on Driving and Working Hours in Road Transportation
Vehicle Routing under Consideration of Driving and Working Hours, 2011Co-Authors: Christoph Manuel MeyerAbstract:In this chapter the rules of the European Social Legislation are presented. The restrictions to be considered by freight forwarding companies are mainly laid down in two laws: Regulation (EC) No 561/2006 restricts driving hours and Directive 2002/15/EC gives restrictions on working hours of persons engaged in road transportation.
-
Dispatchers' Tasks in Combined Vehicle Routing and Break Scheduling
Vehicle Routing under Consideration of Driving and Working Hours, 2011Co-Authors: Christoph Manuel MeyerAbstract:The rules on driving and working times set by the European Social Legislation have to be respected by dispatchers when creating vehicle routes, which is a partial task of the order dispatching process. In this chapter the impact of the legal rules on order dispatching is analyzed. Furthermore, the integration of the legal rules on driving and working hours in practical freight forwarding is investigated.
-
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
Transportation Science, 2010Co-Authors: A. Leendert Kok, Christoph Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 restricted dynamic programming heuristic for the vehicle routing problem with time windows and the full European Social Legislation on drivers' driving and working hours. The problem we consider includes all rules in this Legislation, whereas in the literature only a basic set of rules has been addressed. In addition to this basic set of rules, the Legislation contains a set of modifications that allow for more flexibility. To include the Legislation in the restricted dynamic programming heuristic, we propose a break scheduling heuristic. Computational results show that our method finds solutions to benchmark instances---which only consider the basic set of rules---with 18% fewer vehicles and 5% less travel distance than state-of-the-art approaches. Moreover, our results are obtained with significantly less computational effort. Furthermore, the results show that including a set of rules on drivers' working hours---which has been generally ignored in the literature---has a significant impact on the resulting vehicle schedules: 3.9% more vehicle routes and 1.0% more travel distances are needed. Finally, using the modified rules of the Legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5% in travel distances. Therefore, the modified rules should be exploited in practice.
J. Marco J. Schutten - One of the best experts on this subject based on the ideXlab platform.
-
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
Transportation Science, 2010Co-Authors: A. Leendert Kok, Christoph Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 restricted dynamic programming heuristic for the vehicle routing problem with time windows and the full European Social Legislation on drivers' driving and working hours. The problem we consider includes all rules in this Legislation, whereas in the literature only a basic set of rules has been addressed. In addition to this basic set of rules, the Legislation contains a set of modifications that allow for more flexibility. To include the Legislation in the restricted dynamic programming heuristic, we propose a break scheduling heuristic. Computational results show that our method finds solutions to benchmark instances---which only consider the basic set of rules---with 18% fewer vehicles and 5% less travel distance than state-of-the-art approaches. Moreover, our results are obtained with significantly less computational effort. Furthermore, the results show that including a set of rules on drivers' working hours---which has been generally ignored in the literature---has a significant impact on the resulting vehicle schedules: 3.9% more vehicle routes and 1.0% more travel distances are needed. Finally, using the modified rules of the Legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5% in travel distances. Therefore, the modified rules should be exploited in practice.
-
Dynamic programming algorithm for the vehicle routing problem with time windows and EC Social Legislation
2009Co-Authors: A. Leendert Kok, C. Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 effect 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% regarding the travel distance. Therefore, the optional rules should be exploited in practice.
A. Leendert Kok - One of the best experts on this subject based on the ideXlab platform.
-
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
Transportation Science, 2010Co-Authors: A. Leendert Kok, Christoph Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 restricted dynamic programming heuristic for the vehicle routing problem with time windows and the full European Social Legislation on drivers' driving and working hours. The problem we consider includes all rules in this Legislation, whereas in the literature only a basic set of rules has been addressed. In addition to this basic set of rules, the Legislation contains a set of modifications that allow for more flexibility. To include the Legislation in the restricted dynamic programming heuristic, we propose a break scheduling heuristic. Computational results show that our method finds solutions to benchmark instances---which only consider the basic set of rules---with 18% fewer vehicles and 5% less travel distance than state-of-the-art approaches. Moreover, our results are obtained with significantly less computational effort. Furthermore, the results show that including a set of rules on drivers' working hours---which has been generally ignored in the literature---has a significant impact on the resulting vehicle schedules: 3.9% more vehicle routes and 1.0% more travel distances are needed. Finally, using the modified rules of the Legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5% in travel distances. Therefore, the modified rules should be exploited in practice.
-
Dynamic programming algorithm for the vehicle routing problem with time windows and EC Social Legislation
2009Co-Authors: A. Leendert Kok, C. Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 effect 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% regarding the travel distance. Therefore, the optional rules should be exploited in practice.
Herbert Kopfer - One of the best experts on this subject based on the ideXlab platform.
-
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
Transportation Science, 2010Co-Authors: A. Leendert Kok, Christoph Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 restricted dynamic programming heuristic for the vehicle routing problem with time windows and the full European Social Legislation on drivers' driving and working hours. The problem we consider includes all rules in this Legislation, whereas in the literature only a basic set of rules has been addressed. In addition to this basic set of rules, the Legislation contains a set of modifications that allow for more flexibility. To include the Legislation in the restricted dynamic programming heuristic, we propose a break scheduling heuristic. Computational results show that our method finds solutions to benchmark instances---which only consider the basic set of rules---with 18% fewer vehicles and 5% less travel distance than state-of-the-art approaches. Moreover, our results are obtained with significantly less computational effort. Furthermore, the results show that including a set of rules on drivers' working hours---which has been generally ignored in the literature---has a significant impact on the resulting vehicle schedules: 3.9% more vehicle routes and 1.0% more travel distances are needed. Finally, using the modified rules of the Legislation leads to an additional reduction of 4% in the number of vehicles and of 1.5% in travel distances. Therefore, the modified rules should be exploited in practice.
-
Dynamic programming algorithm for the vehicle routing problem with time windows and EC Social Legislation
2009Co-Authors: A. Leendert Kok, C. Manuel Meyer, Herbert Kopfer, J. Marco J. SchuttenAbstract:In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding 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 effect 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% regarding the travel distance. Therefore, the optional rules should be exploited in practice.
Adela Poliaková - One of the best experts on this subject based on the ideXlab platform.
-
Social law in road transport like tool safety road transport
2018 XI International Science-Technical Conference Automotive Safety, 2018Co-Authors: Miloš Poliak, Peter Medvid, Adela Poliaková, Michaela Mrnikova, Patrícia Šimurková, Salvador HernandezAbstract:The mission of the specialized requirements of Social law in road transport is to ensure that the driver's work regime is in line with the specific requirements of the road transport transport process and also contributes to the improvement of road safety. Currently, the requirements of Social Legislation in the EU and the AETR contracting states are largely unclear from the driver's position. The aim of the contribution is to verify, on the basis of an analysis of Social requirements for drivers in other countries, the hypothesis that regulatory requirements in EU and AETR contracting states are considerably more complicated than in selected other countries. The contribution analyses the impact of the limitations of Social law in road transport on the work of drivers. It analyses requirements for freight transport drivers in the EU and compares them with requirements in chosen countries (USA, Canada, Australia, New Zealand) and with requirements imposed on AETR contracting parties. The article also points to the fact that some of the requirements of Social Legislation in road waste are causing a reduction in road safety.
-
relation of Social Legislation in road transport on driver s work quality
International Conference on Transport Systems Telematics, 2015Co-Authors: Miloš Poliak, Adela PoliakováAbstract:This paper analyses a problematics of a Social law limitation in road transport on drivers work. It analyses the demands on drivers in road freight transport in European Union and compares them with demands in chosen states (USA, Canada, Australia, New Zealand) and with demands for AETR Agreement Member States. From 2010 the conditions of Social right are unified for AETR Agreement Member States, including Russia, Ukraine, Belarus, Serbia and for European Union Member States, but these unified conditions are much stronger comparing to conditions in said analysed countries that are not EU members nor AETR Agreement members. The paper shows on Social right limitation influence in road transport on transport economy that is indirectly influencing on safety and quality of driver’s work. The paper refers the possible risks of driver’s work from the point of view of safety and quality that are caused by road transport Social right limitation.
-
TST - Relation of Social Legislation in Road Transport on Driver’s Work Quality
Communications in Computer and Information Science, 2015Co-Authors: Miloš Poliak, Adela PoliakováAbstract:This paper analyses a problematics of a Social law limitation in road transport on drivers work. It analyses the demands on drivers in road freight transport in European Union and compares them with demands in chosen states (USA, Canada, Australia, New Zealand) and with demands for AETR Agreement Member States. From 2010 the conditions of Social right are unified for AETR Agreement Member States, including Russia, Ukraine, Belarus, Serbia and for European Union Member States, but these unified conditions are much stronger comparing to conditions in said analysed countries that are not EU members nor AETR Agreement members. The paper shows on Social right limitation influence in road transport on transport economy that is indirectly influencing on safety and quality of driver’s work. The paper refers the possible risks of driver’s work from the point of view of safety and quality that are caused by road transport Social right limitation.
