EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
4205. A Multi-Trip Periodic Vehicle Routing Problem with Time Windows, Split Delivery for Simultaneous Pick-Up and Delivery
Invited abstract in session MA-60: Vehicle routing I, stream Transportation.
Monday, 8:30-10:00Room: S09 (building: 101)
Authors (first author is the speaker)
1. | Gorkem Yilmaz
|
Industrial Engineering, Izmir University of Economics |
Abstract
Efficient vehicle routing and delivery planning are critical challenges in logistics systems, impacting operational effectiveness and cost efficiency. Planners are tasked with devising effective delivery and pick-up schedules to meet customers' needs, considering factors such as pick-up and demand quantities per customer, available working hours, shift times, total distances between customer locations, cost parameters, and various transportation constraints. Delivery planners allocate vehicles, determine the start time of service, optimize vehicle routes within specified time windows, schedule shifts, and decide on the number of tours for each vehicle. These actions aim to maximize vehicle utilization and meet requirements at minimum cost. We propose mixed integer programming models that reduce the logistic costs and number of vehicle traffic by combining shipments from different customers. To solve large problems, we propose a decomposition-based heuristics that separates periods by considering time windows and setting an objective that first minimizes the number of used vehicles in each period. The results show that inefficient transportation between two nodes is avoided, the numbers of vehicles are decreased, the utilization rate of each vehicle is increased, and vehicle traffic is reduced in each customer area.
Keywords
- Vehicle Routing
- Transportation
- Mathematical Programming
Status: accepted
Back to the list of papers