en
Scientific article
English

A variable neighborhood search heuristic for the designn of multicommodity production–distribution networksm with alternative facility configurations

Published inOR Spectrum, vol. 33, p. 989-1007
Publication date2011
Abstract

This paper proposes efficient heuristics to solve large-scale production–distribution network design models. The problem studied is an extension of the twoechelon multicommodity CFLPSS (capacitated facility location problem with single sourcing) considering direct shipments frommanufacturing facilities, alternative facility configurations, and concave inventory holding costs. After reviewing the relevant literature, a detailed description of the production–distribution network design problem studied is provided, and the problem is formulated as a mixed-integer program. The heuristic solution approach proposed is then presented. It is a variable neighborhood search (VNS) method integrating a tabu procedure. Experiments are designed to calibrate the heuristics developed, and to compare their performance with the CPLEX solver, for problems with different realistic characteristics. Computational results are presented and discussed.

Keywords
  • Production–distribution networks
  • Location–allocation problem
  • Facilities configuration
  • Tabu search
  • Variable neighborhood search
Citation (ISO format)
AMRANI, Houssam et al. A variable neighborhood search heuristic for the designn of multicommodity production–distribution networksm with alternative facility configurations. In: OR Spectrum, 2011, vol. 33, p. 989–1007.
Main files (1)
Article (Published version)
accessLevelRestricted
Identifiers
  • PID : unige:26164
475views
0downloads

Technical informations

Creation01/29/2013 12:18:00 PM
First validation01/29/2013 12:18:00 PM
Update time03/14/2023 8:01:23 PM
Status update03/14/2023 8:01:23 PM
Last indexation01/16/2024 1:08:20 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack