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

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.

[1]  Lei Lei,et al.  A zero-inventory production and distribution problem with a fixed customer sequence , 2008, Ann. Oper. Res..

[2]  Julio L. Rivera,et al.  Environmental implications of planned obsolescence and product lifetime: a literature review , 2016 .

[3]  Zhi-Long Chen,et al.  Integrated Production and Outbound Distribution Scheduling: Review and Extensions , 2010, Oper. Res..

[4]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[5]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[6]  Philippe Lacomme,et al.  A GRASPxELS Approach for the Resolution of the Integrated Production and Transportation scheduling Problem , 2015 .

[7]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[8]  Ammar Oulamara,et al.  Permutation flowshop scheduling problems with maximal and minimal time lags , 2006, Comput. Oper. Res..

[9]  Philippe Lacomme,et al.  A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems , 2012, Eng. Appl. Artif. Intell..

[10]  Heinrich Kuhn,et al.  An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy , 2014, Comput. Oper. Res..

[11]  John E. Beasley,et al.  Route first--Cluster second methods for vehicle routing , 1983 .

[12]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[13]  E. Nowicki,et al.  A block approach for single-machine scheduling with release dates and due dates , 1986 .

[14]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[15]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[16]  An Caris,et al.  Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion , 2017, Comput. Ind. Eng..

[17]  Priyantha Devapriya,et al.  Optimal Fleet Size of an Integrated Production and Distribution Scheduling Problem for a Single Perishable Product , 2008 .

[18]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[19]  Steffen Wolf,et al.  Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem , 2007, Hybrid Metaheuristics.

[20]  C. Bierwirth A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[21]  H. Neil Geismar,et al.  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan , 2008, INFORMS J. Comput..

[22]  H. Neil Geismar,et al.  Integrated production and distribution scheduling with a perishable product , 2017, Eur. J. Oper. Res..

[23]  Philippe Lacomme,et al.  Order-first split-second methods for vehicle routing problems: A review , 2014 .

[24]  J. Dongarra Performance of various computers using standard linear equations software , 1990, CARN.

[25]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[26]  M H Farahi,et al.  AN ALGORITHM FOR THE SHORTEST PATH PROBLEM , 2005 .

[27]  Bernardo Almada-Lobo,et al.  An adaptive large neighbourhood search for the operational integrated production and distribution problem of perishable products , 2015 .

[28]  Ismail Karaoglan,et al.  The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm , 2017, Int. J. Prod. Res..

[29]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[30]  Rakesh Nagi,et al.  A review of integrated analysis of production-distribution systems , 1999 .

[31]  Peter Baker,et al.  Supply chain segmentation in the sporting goods industry , 2014 .