683. Optimization Methodologies for the Family Capacitated Vehicle Routing Problem
Invited abstract in session WB-58: Heuristics for Vehicle Routing 1, stream Vehicle Routing and Logistics.
Wednesday, 10:30-12:00Room: Liberty 1.13
Authors (first author is the speaker)
| 1. | Konstantinos Toulis
|
| Department of Management Science & Technology, Athens University of Economics and Business | |
| 2. | Emmanouil Zachariadis
|
| Department of Management Science & Technology, Athens University of Economics and Business |
Abstract
The Family Capacitated Vehicle Routing Problem (F-CVRP) is a new VRP variant, which can be used to effectively model order picking scenarios in warehouses using a scattered storage policy. In the F-CVRP, customers are grouped into families, and an exact number of customers from each family must be served while respecting vehicle capacity constraints. Customers belonging to the same family have equal demands, corresponding to the same ordered items stored in different places within a warehouse. Given a set of orders and a maximum capacity for the pickers, the F-CVRP calls for determining optimal routes within the warehouse for the order picking process. To effectively tackle the F-CVRP we propose a minimum insertion heuristic for initial solution construction, a local search with tabu policies for further refinement, a large neighborhood search with adaptive memory to diversify the solution space exploration as well as exact methodologies to calculate optimal substitutions of customers that are present in the solution. When benchmarked against already published results, the proposed methodologies manage to match or improve the best-known upper bound in 95.5% of instances, demonstrating the effectiveness of our approach. The research project was supported by the Hellenic Foundation for Research and Innovation (H.F.R.I.) under the “2nd Call for H.R.F.I. Research Projects to support Faculty Members & Researchers” (Project Number: 02562).
Keywords
- Vehicle Routing
- Metaheuristics
- Adaptive Memory Programming
Status: accepted
Back to the list of papers