The location routing problem (LRP) is a relatively new research direction within location
analysis that takes into account vehicle routing aspects. The goal of LRP is to solve a facility …

The success of a logistics system may depend on the decisions of the depot locations and
vehicle routings. The location routing problem (LRP) simultaneously tackles both location …

In this paper, we define the standard LRP as a deterministic, static, discrete, single-echelon,
single-objective location-routing problem in which each customer (vertex) must be visited …

This paper introduces the open location-routing problem (OLRP) that is a variant of the
capacitated location-routing problem (CLRP). OLRP is motivated from the rise in contracting …

In this work we consider a Transportation Location Routing Problem (TLRP) that can be
seen as an extension of the two stage Location Routing Problem, in which the first stage …

A notable portion of the total primary energy is consumed by today's buildings in developed
countries. In recent years, decision makers and planners are facing increased pressure to …

In this paper, a new version of the particle swarm optimization (PSO) algorithm suitable for
discrete optimization problems is presented and applied for the solution of the capacitated …

This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to
minimize waiting time of recipients by optimally determining both the locations of depots and …

This paper proposes a model for obnoxious waste location-routing problem (LRP)
considering various types of wastes and several treatment technologies. The investigated …

It is not rare that the performance of one metaheuristic algorithm can be improved by
incorporating ideas taken from another. In this article we present how Simulated Annealing …