A Vehicle Routing Problem with Periodic Replanning

Proceedings

Guido Ignacio Novoa-Flores¹  Luisa Carpente¹  Silvia Lorenzo-Freire¹ 

[1] MODES Research Group, Department of Mathematics, Faculty of Computer Science, University of A Coruña, 15071 A Coruña, Spain;

关键词: combinatorial optimization;    heuristic algorithms;    vehicle routing problems;   

DOI  :  10.3390/proceedings2181192

来源: DOAJ

【 摘 要 】

In this work we focus on the problem of truck fleet management of the company GESUGA. This company is responsible of the collection and proper treatment of animals not intended for human consumption. On a daily basis, with the uncollected requests, the company designs the routes for the next day. However, these routes have to be replanned during their execution as new requests appear from customers that the company would be interested in attending. The problem treated belongs to the family MDCVRPTW with the particularity of the route redesign. For its resolution we have adapted linear programming models, simulation techniques and metaheuristic algorithms.

【 授权许可】

Unknown