Scenario-Based Location Arc Routing Problems: Introducing Mathematical Models
A location arc routing problem (LARP) is an important issue that finds the best locations of depots and routing simultaneously. It deals with a routing problem, in which demands are on arcs instead of nodes. Additionally, parameters may not be deterministic in real problems. Thus, this paper addresses an uncertain LARP through developing a deterministic mathematical model regarding to the respective literature and employing two scenario-based approaches. The objectives of the model are to minimize the maximum regret and minimize the mean and deviation of the objective function value (OFV). A numerical example is generated and the results analyze the performance of scenario-based models.
KeywordsLocation arc routing Mathematical model Scenario-based Regret
- 2.Bodin L, Levy L (1989) The arc oriented location routing problem. INFOR Inf Syst Oper Res 27(1):74–94Google Scholar
- 4.Drexl M, Schneider M (2014) A Survey of the Standard Location-Routing Problem. Publications of Darmstadt Technical University Institute for Business StudiesGoogle Scholar
- 6.Ghiani G, Laporte G (2001) Location-arc routing problems. Opserach 38(2):151–159Google Scholar