EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1415. Comparison of Formulations for the Family Capacitated Vehicle Routing Problem
Invited abstract in session WA-58: MILPs for Vehicle Routing 2, stream VeRoLog - Vehicle Routing and Logistics.
Wednesday, 8:30-10:00Room: S07 (building: 101)
Authors (first author is the speaker)
| 1. | Raquel Bernardino
|
| ISEG, CEMAPRE, UL | |
| 2. | Ana Paias
|
| DEIO - CMAFCIO, Universidade de Lisboa, Faculdade de Ciências |
Abstract
The family capacitated vehicle routing problem (F-CVRP) is an NP-hard problem that generalizes both the FTSP and the capacitated vehicle routing problem. The F-CVRP has practical applications in warehouse management in warehouses with scattered storage. We propose several compact and non-compact formulations to address the problem. These formulations are compared both theoretically and computationally. Additionally, sets of valid inequalities are also derived and tested computationally. A branch-and-cut algorithm is used as a solution method for the non-compact formulations. Computational results show that both the developed branch-and-cut algorithm and the best-performing compact model are suited to address small to medium-sized instances of the F-CVRP.
Keywords
- Vehicle Routing
- Programming, Mixed-Integer
- Branch and Cut
Status: accepted
Back to the list of papers