EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2855. The multi-product pickup and delivery problem with time windows and alternative destinations.
Invited abstract in session TD-55: Freight transportation and logistic III, stream Transportation.
Tuesday, 14:30-16:00Room: S02 (building: 101)
Authors (first author is the speaker)
| 1. | Mikele Gajda
|
| Department of Operations, UNIL | Université de Lausanne |
Abstract
We introduce and investigate the multi-product pickup and delivery problem with time windows and alternative destinations. In this problem, we consider a fleet of vehicles with a predetermined capacity for serving multiple customer orders simultaneously. Each order consists of a collection of products, possibly with different pickup locations, and a set of potential delivery points with specific time windows for customer service. To comprehensively investigate the problem, we construct an extensive set of instances that build upon the well-known CVRPLIB dataset. We provide a formal problem description formulated as a MILP and obtain optimal solutions using a branch-and-bound approach. Finally, considering the problem's inherent complexity, we propose a hybrid adaptive large neighborhood search. Our algorithm demonstrates effectiveness in obtaining satisfactory solutions for medium and large-scale instances, which typically pose challenges for exact methods.
Keywords
- Vehicle Routing
- Combinatorial Optimization
- Metaheuristics
Status: accepted
Back to the list of papers