Integrated locating in-house logistics areas and transport vehicles selection problem in assembly lines

Decentralised in-house logistics areas, known as supermarkets, are widely used in the manufacturing industry for parts feeding to assembly lines. In contrary to the literature and inspired by observation in a real case, this study relaxes the assumption of using identical transport vehicles when dec...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2021, Vol.59 (2), p.598-616
Main Authors: Nourmohammadi, Amir, Eskandari, Hamidreza, Fathi, Masood, Ng, Amos H.C.
Format: Article
Language:English
Subjects:
Assembly lines
Computing time
genetic algorithm
Genetic algorithms
In-house logistics
Integer programming
Linear programming
Logistics
Mixed integer
mixed-integer programming
parts feeding
Production and Automation Engineering
Produktion och automatiseringsteknik
Simulated annealing
supermarket location
Supermarkets
Transport vehicles
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Decentralised in-house logistics areas, known as supermarkets, are widely used in the manufacturing industry for parts feeding to assembly lines. In contrary to the literature and inspired by observation in a real case, this study relaxes the assumption of using identical transport vehicles when deciding on the supermarkets' location by considering the availability of different vehicles. In this regard, this study deals with the integrated supermarket location and transport vehicles selection problems (SLTVSP). A mixed-integer programming (MIP) model of the problem is developed. Due to the complexity of the problem, a hybrid genetic algorithm (GA) with variable neighborhood search (GA-VNS) is also proposed to address large-sized problems. The performance of GA-VNS is compared against the MIP, the basic GA, and simulated annealing (SA) algorithm. The computational results from the real case and a set of generated test problems show that GA-VNS provides a very good approximation of the MIP solutions at a much shorter computational time while outperforming the other compared algorithms. The analysis of the results reveals that it is beneficial to apply different transport vehicles rather than identical vehicles for SLTVSP.
ISSN:0020-7543
1366-588X
1366-588X
DOI:10.1080/00207543.2019.1701207