Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
type: Item
instance of: scholarly article
title: Optimization of a two-echelon location lot-sizing routing problem with deterministic demand
zbMATH Open document ID: 1426.90047
DOI: 10.1155/2018/2745437
author: Laila Kechmane
author: Benayad Nsiri
author: A. Baalal
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: This paper aims to solve a multiperiod location lot-sizing routing problem with deterministic demand in a two-echelon network composed of a single factory, a set of potential depots, and a set of customers. Solving this problem involves making strategic decisions such as location of depots as well as operational and tactical decisions which include customers' assignment to the open depots, vehicle routing organization, and inventory management. A mathematical model is presented to describe the problem and a genetic algorithm combined with a local search procedure is proposed to solve it and is tested over three sets of instances.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 7018698
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/2745437
OpenAlex ID: W2807849445
cites work: An inventory-location model: Formulation, solution algorithm and computational results
cites work: Capacitated warehouse location model with risk pooling
cites work: Incorporating inventory and routing costs in strategic location models
cites work: Facility location and supply chain management. A review
cites work: The effect of ignoring routes when locating depots
cites work: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
cites work: A GRASP\(\times \)ELS approach for the capacitated location-routing problem
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: An exact method for the capacitated location-routing problem
cites work: An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
cites work: A survey of recent research on location-routing problems
cites work: Solving a rich vehicle routing and inventory problem using column generation
cites work: A hybrid heuristic for an inventory routing problem
cites work: The exact solution of several classes of inventory-routing problems
cites work: A Price-Directed Approach to Stochastic Inventory/Routing
cites work: Using scenario trees and progressive hedging for stochastic inventory routing problems
cites work: Scenario tree-based heuristics for stochastic inventory-routing problems
cites work: Distribution network design: New problems and related models
cites work: A genetic algorithm approach to the integrated inventory-distribution problem
cites work: \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
cites work: A multi-objective evolutionary optimization approach for an integrated location-inventory distribution network problem under vendor-managed inventory systems
Wikidata QID: Q129726406
description: scientific article; zbMATH DE number 7018698