Location-routing problem (LRP) thoroughly considers location allocation (LAP) and vehicle routing (VRP) which has been an integral part applied in modern logistics. A number of researchers at home aboard have put forward their views by establishing fine models. On the basis studying previous research results classification, summary, comparative analysis, this study hence proposes a new solution...

Given the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at strategic level, a network design problem under uncertainty. This is defined as stochastic multi-period capacitated location-routing (2E-SM-CLRP). It considers partitioned into two echelons: each echelon involves specific location-assignment-transportation schema that must cope with fut...

Disaster relief distribution is a very important component in the overall disaster response process. Consideration of limited funds, time pressure and surge demand that come together increase to complexity process must be done short time. Meanwhile, delays delivery can lead decrease level safety welfare disaster-affected victims. This paper proposes location routing problem optimization model f...

In this paper, we present a new mass-flow based Mixed Integer Linear Programming (MILP) formulation for the Inventory Routing Problem (IRP) with explicit energy consumption. The problem is based on a multiperiod single-vehicle IRP with one depot and several customers. Instead of minimizing the distance or inventory cost, the problem takes energy minimization as an objective. In this formulation...

Location-Routing Problem (LRP) can model several life situations. In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP). We propose a twophase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (A...