|
专家姓名 |
Andreas Bortfeldt |
专家所在单位 |
Otto von Guericke University |
|
专家职称 |
教授 |
专家职务 |
|
|
专家简介 |
The research interests of Dr. Andreas Bortfeldt focus on advanced methods for decision support like graph search strategies and metaheuristics, including also parallel metaheuristics. New approaches are developed in the first line for cutting and packing problems of different types and dimensions. Recently highly topical problems in the area of transportation logistics which combine packing and routing aspects are investigated. Moreover, other application fields, e.g., container management in seaports or school timetabling, are also addressed. Further research activities are concerned with the development of patterns for object oriented system analysis. Current research projects are dealing with:
• the development of metaheuristics for solving different vehicle routing and three-dimensional loading problems
• the development of a graph search approach for three-dimensional container loading that is capable to take into account a broad spectrum of packing constraints
• the development of graph search approaches for container pre-marshalling problems in container seaports
• the development of an instance generator for 3D container loading problems with multiple constraints. |
|
拟开设课程（讲座）基本情况 |
|
讲座2名称 |
Vehicle routing with three-dimensional loading constraints and split pickup |
是否全英语教学：是 |
|
讲座地点 |
海韵教学楼105 |
讲座时间 |
7月18日下午4:00 |
|
内容简介 |
The capacitated vehicle routing problem with three-dimensional loading constraints (3L-CVRP) combines vehicle routing and three-dimensional loading with additional packing constraints concerning, for example, the stability of packed goods. We consider a Shanghai automotive logistics company that serves many car makers in metropolitan Shanghai and whole China. The company performs milk-run operations in and around Shanghai where goods are picked up at different sites by identical vehicles. Often, the load of one site exceeds the volume capacity of a vehicle. Therefore, we focus on the 3L-CVRP with split pickup. We propose a hybrid algorithm for this problem with two main steps. In the first step, shuttle routes, other small routes and related packing plans are calculated which serve primarily those customers who have a load that exceeds or almost reaches the volume capacity of a vehicle. In the second step, the residual problem is solved as 3L-CVRP without splits by means of a well-known solution method. The hybrid algorithm is tested by a set of instances that comes from real industrial data, with up to 46 sites and 1549 boxes to be transported. The hybrid algorithm yields good results within short computing times. |