Highlights We introduce the time-dependent location-routing problem. We propose a mathematical formulation and valid inequalities for this problem. We generate a large set of instances based on real traffic data. We propose several heuristics to provide good quality initial solutions. We propose a matheuristic that solves a set partitioning problem to improve solutions.
The time-dependent location-routing problem
2019-06-22
23 pages
Article (Journal)
Electronic Resource
English
Time-Dependent Green Location-Routing Problem under Carbon Cap-and-Trade Policy
Transportation Research Record | 2022
|The time-dependent pollution-routing problem
Online Contents | 2013
|The time-dependent pollution-routing problem
Elsevier | 2013
|Time-Dependent Green Vehicle Routing Problem
Springer Verlag | 2020
|A warehouse location-routing problem
Elsevier | 1985
|