A genetic algorithm approach for location-inventory-routing problem with perishable products

Abdelhalim Hiassat, Ali Diabat, Iyad Rahwan

Research output: Contribution to journalArticlepeer-review


In this paper, we address a location-inventory-routing model for perishable products. The model determines the number and location of required warehouses, the inventory level at each retailer, and the routes traveled by each vehicle. The proposed model adds location decisions to a recently published inventory routing problem in order to make it more practical, thus supporting the prevalent claim that integration of strategic, tactical and operational level decisions produces better results for supply chains. Given that the model developed here is NP-hard, with no algorithm capable of finding its solution in polynomial time, we develop a Genetic Algorithm approach to solve the problem efficiently. This approach achieves high quality near-optimal solutions in reasonable time. Furthermore, the unique structure of the problem requires developing a new chromosome representation, as well as local search heuristics. Finally, an analysis is carried out to verify the effectiveness of the algorithm.

Original languageEnglish (US)
Pages (from-to)93-103
Number of pages11
JournalJournal of Manufacturing Systems
StatePublished - Jan 1 2017


  • Facility location
  • Genetic algorithms
  • Integer programming
  • Inventory management
  • Perishable products
  • Supply chain
  • Vehicle routing

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Hardware and Architecture
  • Industrial and Manufacturing Engineering


Dive into the research topics of 'A genetic algorithm approach for location-inventory-routing problem with perishable products'. Together they form a unique fingerprint.

Cite this