Location-routing problem with time-dependent demands

Yu, Vincent F. and Normasari, Nur Mayke Eka and Chen, Wei-Hao (2021) Location-routing problem with time-dependent demands. Computers and Industrial Engineering, 151. ISSN 03608352

Full text not available from this repository. (Request a copy)

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. © 2020 Elsevier Ltd

Item Type: Article
Additional Information: Cited by: 18
Uncontrolled Keywords: Heuristic algorithms; Integer programming; Nonlinear programming; Simulated annealing; Computational studies; Demand rates; Location routing problem; Mixed-integer nonlinear programming; Simulated annealing algorithms; Time dependency; Time-dependent demand; Total distances; Location
Subjects: T Technology > TJ Mechanical engineering and machinery
Divisions: Faculty of Engineering > Mechanical and Industrial Engineering Department
Depositing User: Sri JUNANDI
Date Deposited: 05 Oct 2024 07:23
Last Modified: 05 Oct 2024 07:23
URI: https://ir.lib.ugm.ac.id/id/eprint/8821

Actions (login required)

View Item
View Item