Outsourcing in location and route planning for small package shippers
Cancelled
Event details
| Date | 23.04.2012 |
| Hour | 10:30 › 12:00 |
| Speaker |
Andreas Stenger, IT-based Logistics, Goethe University Frankfurt. In 2009, Andreas Stenger obtained a degree in Business Administration and Electrical Engineering from Technical University Kaiserslautern (Germany). During his studies, he spent one semester at TŽlŽcom ƒcole de Management (France) and gained practical experience in project management and production process optimization through his work at Airbus and Bosch Rexroth. From October 2009 to February 2012, he worked as research assistant at the Chair of IT-based Logistics at Goethe University Frankfurt (Germany). In his research, he focused on route and location planning problems for small package shippers and the design of efficient heuristic solution methods. |
| Location | |
| Category | Conferences - Seminars |
Driven by increased competition and cost pressure, small package shippers aim at improving the cost-efficiency of their transportation network. In this context, one important trend is to subcontract last-mile deliveries to small regional shippers. Although a huge amount of articles on the optimization of vehicle routes and depot locations of small package shippers exists in the Operations Research literature, subcontractors are rarely considered.
In this talk, a new routing problem, called Multi-Depot Vehicle Routing Problem with Private Fleet and Common Carriers (MDVRPPC), is presented, where customers can either be served by the private fleet positioned at self-owned depots or by subcontractors. To solve the NP-hard problem, an effective Variable Neighborhood Search algorithm is presented that incorporates an adaptive mechanism to bias the random shaking step towards profitable areas of the solution space. The approach is successfully used to solve MDVRPPC as well as closely related problems, such as the MDVRP and the single-depot VRP with Private fleet and Common carriers (VRPPC), obtaining high quality solutions within short computing time. The extensive testing on these problems shows the positive impact of the adaptive mechanism with respect to a standard VNS algorithm.
In this talk, a new routing problem, called Multi-Depot Vehicle Routing Problem with Private Fleet and Common Carriers (MDVRPPC), is presented, where customers can either be served by the private fleet positioned at self-owned depots or by subcontractors. To solve the NP-hard problem, an effective Variable Neighborhood Search algorithm is presented that incorporates an adaptive mechanism to bias the random shaking step towards profitable areas of the solution space. The approach is successfully used to solve MDVRPPC as well as closely related problems, such as the MDVRP and the single-depot VRP with Private fleet and Common carriers (VRPPC), obtaining high quality solutions within short computing time. The extensive testing on these problems shows the positive impact of the adaptive mechanism with respect to a standard VNS algorithm.
Links
Practical information
- General public
- Free
- This event is internal
Organizer
- ENAC TRANSP-OR