An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls |
| |
Authors: | G. Yazgı Tü tü ncü |
| |
Affiliation: | IÉSEG School of Management, CNRS-LEM (UMR 8179), 3 Rue de la Digue, Lille, France; Izmir University of Economics, Department of Mathematics, Izmir, Turkey |
| |
Abstract: | In this article, a visual interactive approach based on a new greedy randomised adaptive memory programming search (GRAMPS) algorithm is proposed to solve the heterogeneous fixed fleet vehicle routing problem (HFFVRP) and a new extension of the HFFVRP, which is called heterogeneous fixed fleet vehicle routing problem with backhauls (HFFVRPB). This problem involves two different sets of customers. Backhaul customers are pickup points and linehaul customers are delivery points that are to be serviced from a single depot by a heterogeneous fixed fleet of vehicles, each of which is restricted in the capacity it can carry, with different variable travelling costs. |
| |
Keywords: | Routing Metaheuristics GRAMPS Heterogeneous fixed fleet Backhauls |
本文献已被 ScienceDirect 等数据库收录! |
|