An Adapted Version of the Water Wave Optimization Algorithm for the Capacitated Vehicle Routing Problem with Time Windows with Application to a Real Case Using Probe Data

Letizia Tebaldi, Teresa Murino and Eleonora Bottani
Additional contact information
Letizia Tebaldi: Department of Engineering and Architecture, University of Parma, viale delle Scienze 181/A, 43124 Parma, Italy
Teresa Murino: Department of Chemical, Materials and Industrial Production Engineering, University of Naples “Federico II”, Piazzale Tecchio 80, 80125 Napoli, Italy
Eleonora Bottani: Department of Engineering and Architecture, University of Parma, viale delle Scienze 181/A, 43124 Parma, Italy

Sustainability, 2020, vol. 12, issue 9, 1-13

Abstract: Customers’ habits, as far as shipping requests are concerned, have changed in the last decade, due to the fast spread of e-commerce and business to consumer (B2C) systems, thus generating more and more vehicles on the road, traffic congestion and, consequently, more pollution. Trying to partially solve this problem, the operational research field dedicates part of its research to possible ways to optimize transports in terms of costs, travel times, full loads etc., with the aim of reducing inefficiencies and impacts on profit, planet and people, i.e., the well-known triple bottom line approach to sustainability, also thanks to new technologies able to instantly provide probe data, which can detail information as far as the vehicle behavior. In line with this, an adapted version of the metaheuristic water wave optimization algorithm is here presented and applied to the context of the capacitated vehicle routing problem with time windows. This latter one is a particular case of the vehicle routing problem, whose aim is to define the best route in terms of travel time for visiting a set of customers, given the vehicles capacity and time constraints in which some customers need to be visited. The algorithm is then tested on a real case study of an express courier operating in the South of Italy. A nearest neighbor heuristic is applied, as well, to the same set of data, to test the effectiveness and accuracy of the algorithm. Results show a better performance of the proposed metaheuristic, which could improve the journeys by reducing the travel time by up to 23.64%.

Keywords: metaheuristic algorithm; logistics; water wave optimization; routing; vehicle routing problem; sustainability; transport (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.mdpi.com/2071-1050/12/9/3666/pdf (application/pdf)
https://www.mdpi.com/2071-1050/12/9/3666/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:12:y:2020:i:9:p:3666-:d:353063

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().