Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows

DOI10.1504/IJOR.2016.075651zbMath1362.90073OpenAlexW2465057255MaRDI QIDQ2627694

Alireza Afshar-Nadjafi, Behrouz Afshar-Nadjafi

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2016.075651

zbMATH Keywords

simulated annealingmixed integer programmingvehicle routing problemtime dependentMIPheterogeneous fleethard time windowsVRPmultiple depots

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (3)

A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain ⋮ Thirty years of heterogeneous vehicle routing ⋮ How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach

This page was built for publication: Multi-depot time dependent vehicle routing problem with heterogeneous fleet and time windows