An assign-and-route matheuristic for the time-dependent Inventory Routing Problem

Title
An assign-and-route matheuristic for the time-dependent Inventory Routing Problem
Authors
Keywords
Logistics, Inventory routing problem, Time-dependent travelling time, Realistic benchmark, Matheuristic
Journal
Publisher
Elsevier BV
Online
2021-09-23
DOI
10.1016/j.ejor.2021.09.025

Ask authors/readers for more resources

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now