Show simple item record

dc.contributor.authorFerrer Biosca, Alberto
dc.contributor.authorCalvet Liñán, Laura
dc.contributor.authorJuan, Angel A.
dc.contributor.authorMasip Rodó, David
dc.contributor.authorGomes, M. Isabel
dc.identifier.citationFerrer, A. [et al.]. Combining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation. "Computers and industrial engineering", Febrer 2016, vol. 94, p. 93-104.
dc.description.abstractIn real-life logistics and distribution activities it is usual to face situations in which the distribution of goods has to be made from multiple warehouses or depots to the nal customers. This problem is known as the Multi-Depot Vehicle Routing Problem (MDVRP), and it typically includes two sequential and correlated stages: (a) the assignment map of customers to depots, and (b) the corresponding design of the distribution routes. Most of the existing work in the literature has focused on minimizing distance-based distribution costs while satisfying a number of capacity constraints. However, no attention has been given so far to potential variations in demands due to the tness of the customerdepot mapping in the case of heterogeneous depots. In this paper, we consider this realistic version of the problem in which the depots are heterogeneous in terms of their commercial o er and customers show di erent willingness to consume depending on how well the assigned depot ts their preferences. Thus, we assume that di erent customer-depot assignment maps will lead to di erent customer-expenditure levels. As a consequence, market-segmentation strategies need to be considered in order to increase sales and total income while accounting for the distribution costs. To solve this extension of the MDVRP, we propose a hybrid approach that combines statistical learning techniques with a metaheuristic framework. First, a set of predictive models is generated from historical data. These statistical models allow estimating the demand of any customer depending on the assigned depot. Then, the estimated expenditure of each customer is included as part of an enriched objective function as a way to better guide the stochastic local search inside the metaheuristic framework. A set of computational experiments contribute to illustrate our approach and how the extended MDVRP considered here diré in terms of the proposed solutions from the traditional one.
dc.format.extent12 p.
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra
dc.subject.lcshMachine learning
dc.subject.otherMulti-Depot Vehicle Routing Problem
dc.subject.othermarket segmentation applications
dc.subject.otherhybrid algorithms
dc.subject.otherstatistical learning
dc.titleCombining statistical learning with metaheuristics for the multi-depot vehicle routing problem with market segmentation
dc.subject.lemacAprenentatge automàtic
dc.contributor.groupUniversitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
local.citation.authorFerrer, A.; Calvet , L.; Juan, A.; Masip, D.; Gomes , M. Isabel
local.citation.publicationNameComputers and industrial engineering

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain