A mathematical model for the capacitated location-arc routing problem with deadlines and heterogeneous fleet

A mathematical model for the capacitated location-arc routing problem with deadlines and heterogeneous fleet

This paper considers a Capacitated Location-Arc Routing Problem (CLARP) with Deadlines (CLARPD) and a fleet of capacitated heterogeneous vehicles. The proposed mixed integer programming model determines a subset of potential depots to be opened, the served roads within predefined deadlines, and the...

Full description

Bibliographic Details
Main Authors: Soheila Mirzaei-Khafri, Mahdi Bashiri, Roya Soltani, Mohammad Khalilzadeh
Format: Article
Language:English
Published: Vilnius Gediminas Technical University 2019-12-01
Series:Transport
Subjects:
capacitated location-arc routing
mixed integer programming
deadlines
genetic algorithm
simulated annealing
heterogeneous fleet
Online Access:https://journals.vgtu.lt/index.php/Transport/article/view/11145

Internet

https://journals.vgtu.lt/index.php/Transport/article/view/11145

Similar Items