Paper Info
Title
Location-Routing Problem With Time-Dependent Demands
Abstract
This study, by considering the time-dependent demand (TDD) characteristic, investigates the location-routing problem with time-dependent demands (LRPTDD) as an extension of the location-routing problem (LRP). The demand in each customer site is represented by a constant demand rate over a known production period. In the LRPTDD, the locations are selected, and the routes are constructed to pick up all the demands and minimize the total distance. The picked load depends on the vehicle arrival time at the site; thus, the "time-dependency" characteristic of the LRPTDD is based on the vehicle arrival time. A mixed-integer nonlinear programming (MINLP) formulation is presented. A simulated annealing (SA) algorithm for the LRPTDD is developed. The computational study demonstrates the competitiveness of the proposed SA heuristic against other well-known algorithms for LRPs, and most importantly, its effectiveness for the LRPTDD.
Year
DOI
Venue
2021
10.1016/j.cie.2020.106936
COMPUTERS & INDUSTRIAL ENGINEERING
Keywords
DocType
Volume
Location-routing problem, Time-dependent demand, Simulated annealing, Mixed-integer nonlinear programming
Journal
151
ISSN
Citations 
PageRank 
0360-8352
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Vincent F. Yu142427.32
Nur Mayke Eka Normasari200.34
Wu-ton Chen36210.87