A5058243319- Vehicle Routing Optimization Methods
- Transportation and Mobility Innovations
- Urban and Freight Transport Logistics
- Transportation Planning and Optimization
- Optimization and Packing Problems
- Advanced Manufacturing and Logistics Optimization
- Optimization and Search Problems
- Robotic Path Planning Algorithms
- Smart Parking Systems Research
- Scheduling and Optimization Algorithms
- Energy Efficient Wireless Sensor Networks
- Optimization and Mathematical Programming
- Scheduling and Timetabling Solutions
- Supply Chain and Inventory Management
- Data Management and Algorithms
- RFID technology advancements
- Transportation Systems and Safety
- Advanced Optical Network Technologies
- Environmental Science and Technology
- Forest Management and Policy
- Facility Location and Emergency Management
- Species Distribution and Climate Change
- Advanced Research in Systems and Signal Processing
- Maritime Ports and Logistics
- Computational Geometry and Mesh Generation
Johannes Gutenberg University Mainz
2016-2024
University of Vienna
2023-2024
HAN University of Applied Sciences
2011
Abstract The ongoing rise in e-commerce comes along with an increasing number of first-time delivery failures due to the absence customer at location. Failed deliveries result rework which turn has a large impact on carriers’ cost. In classical vehicle routing problem (VRP) time windows, each request only one location and window describing where when shipments need be delivered. contrast, we introduce analyze options (VRPDO), some requests can shipped alternative locations possibly different...
This paper presents a branch-and-price-and-cut algorithm for the exact solution of active-passive vehicle-routing problem (APVRP). The APVRP covers range logistics applications where pickup-and-delivery requests necessitate joint operation active vehicles (e.g., trucks) and passive loading devices such as containers or swap bodies). objective is to minimize weighted sum total distance traveled, completion time routes, number unserved requests. To this end, supports flexible coupling...
This paper studies the vehicle routing and truck driver scheduling problem where routes schedules must comply with hours of service regulations for drivers. It presents a backward labeling method generating feasible shows how labels generated can be combined by forward method. The bidirectional is embedded into branch-and-price-and-cut approach evaluated in United States European Union. Computational experiments show that resulting significantly faster than unidirectional counterparts...
The minimum tour duration problem (MTDP) is a variant of the traveling salesman with time windows, which consists finding window-feasible Hamiltonian path minimizing duration. We present new effective dynamic programming (DP)-based approach for MTDP. When solving windows DP, two independent resources are propagated along partial paths, one costs and earliest arrival times. For dealing minimization, we provide DP formulation three dominance bounding procedures applicable. This nontrivial task...
Delivery options are at the heart of generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests shipped to alternative delivery locations which can also have different windows. Recently, was introduced into scientific literature. It extends GVRPTW by capacities shared and specifying service-level constraints defined customers' preferences for options. The generalizes home roaming multiple For all these variants, we present a widely applicable matheuristic...
With rapid advances in digitization, many critical processes transportation, industries, and our daily life rely on sensor measurements. time, however, the measurements may get gradually biased their precision deteriorates, leading to an enhanced risk of major disruptions caused by false All single are uncertain deviate from true value. To detect malfunctioning sensors early on, a set recent each has be constantly cross-checked against given number other sensors, i.e., should form...
We investigate a new exact solution approach for the Active Passive Vehicle Routing Problem, vehicle routing problem with complicated temporal synchronisation requirements between vehicles. A key contribution is introduction of principle, Delayed Disaggregation, Benders Decomposition to produce disaggregated optimality cuts when traditional block-diagonality fails. The technique applied Mixed Integer Programming formulation Problem. built on coupled movements active and passive vehicles,...
The vehicle routing problem with drones (VRP-D) that we consider is an extension of the capacitated in which fleet consists trucks equipped one drone each. A truck and its can either move together or separately. release at depot a customer location must pick it up later another location. In this way, both deliver goods to customers working as synchronized units. feasible route has satisfy capacity constraints drone. solution VRP-D set routes such each served exactly once by We investigate...