Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product

Autor: Aziz Moukrim, Philippe Lacomme, Alain Quilliot, Marina Vinot
Přispěvatelé: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), ANR-13-BS02-0006,ATHENA,Méthodes d'optimisation pour l'étude intégrée de problèmes décisionnels complexes(2013), Ecole Nationale Supérieure des Mines de St Etienne-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS)
Rok vydání: 2018
Předmět:
Zdroj: International Journal of Production Research
International Journal of Production Research, 2018, 56 (12), pp.4313-4336. ⟨10.1080/00207543.2018.1431416⟩
International Journal of Production Research, Taylor & Francis, 2018, 56 (12), pp.4313-4336. ⟨10.1080/00207543.2018.1431416⟩
ISSN: 1366-588X
0020-7543
DOI: 10.1080/00207543.2018.1431416
Popis: International audience; This paper deals with an extension of the integrated production and transportation scheduling problem (PTSP) by considering multiple vehicles (PTSPm) for optimisation of supply chains. The problem reflects a real concern for industry since production and transportation subproblems are commonly addressed independently or sequentially, which leads to sub-optimal solutions. The problem includes specific capacity constraints, the short lifespan of products and the special case of the single vehicle that has already been studied in the literature. A greedy randomised adaptive search procedure (GRASP) with an evolutionary local search (ELS) is proposed to solve the instances with a single vehicle as a special case. The method has been proven to be more effective than those published and provides shorter computational times with new best solutions for the single vehicle case. A new set of instances with multiple vehicles is introduced to favour equitable future research. Our study extends previous research using an indirect resolution approach and provides an algorithm to solve a wide range of one-machine scheduling problems with the proper coordination of single or multiple vehicles.
Databáze: OpenAIRE
Nepřihlášeným uživatelům se plný text nezobrazuje