Modeling a robust multi-objective locating-routing problem with bounded delivery time using meta-heuristic algorithms
Purpose – This study aims to investigate a locating-routing-allocating problems and the supply chain, including factories distributor candidate locations and retailers. The purpose of this paper is to minimize system costs and delivery time to retailers so that routing is done and the location of th...
Main Authors: | Leila Hashemi, Armin Mahmoodi, Milad Jasemi, Richard C. Millar, Jeremy Laliberté |
---|---|
Format: | Article |
Language: | English |
Published: |
Emerald Publishing
2021-12-01
|
Series: | Smart and Resilient Transportation |
Subjects: | |
Online Access: | https://www.emerald.com/insight/content/doi/10.1108/SRT-08-2021-0008/full/pdf?title=modeling-a-robust-multi-objective-locating-routing-problem-with-bounded-delivery-time-using-meta-heuristic-algorithms |
Similar Items
-
A Hyper Heuristic Algorithm to Solve the Low-Carbon Location Routing Problem
by: Chunmiao Zhang, et al.
Published: (2019-06-01) -
A variable neighborhood descent based heuristic to solve the capacitated location-routing problem
by: M. S. Jabal-Ameli, et al.
Published: (2011-01-01) -
Secured Multi-Dimensional Robust Optimization Model for Remotely Piloted Aircraft System (RPAS) Delivery Network Based on the SORA Standard
by: Armin Mahmoodi, et al.
Published: (2022-06-01) -
A conceptually simple algorithm for the capacitated location-routing problem
by: Maximilian Löffler, et al.
Published: (2023-01-01) -
Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty
by: Rafael D. Tordecilla, et al.
Published: (2021-01-01)