An application of variable neighbourhood search to hospital call scheduling of infant formula promotion

In the infant formula industry, products must rely on the prescription or recommendation from healthcare physicians (HCPs). Therefore, it is the most important activity in sales promotion to call on the identified HCPs in the prospected hospitals by the territory promotional sales representatives (PSRs). The PSRs have to establish their monthly hospital call schedule according to several constraints. In this paper, we investigate the hospital call scheduling of PSRs, a real-world case provided by an international infant formula company operating in Taiwan. The objective is minimising the total travel time. First, we present a four-phase heuristic to quickly generate a feasible schedule. We then apply a variable neighbourhood search incorporated with memory and revolver schemes to improve the solution quality. Through extensive computational experiments, it is shown that the proposed solution approaches are quite effective in terms of solution quality and computation time.

[1]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[2]  Abraham P. Punnen,et al.  The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms , 1997 .

[3]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

[4]  Xianpeng Wang,et al.  A population-based variable neighborhood search for the single machine total weighted tardiness problem , 2009, Comput. Oper. Res..

[5]  Ching-Jong Liao,et al.  A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..

[6]  Hossein Miar Naimi,et al.  New robust and efficient ant colony algorithms: Using new interpretation of local updating process , 2009, Expert Syst. Appl..

[7]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[8]  N. Biggs THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[9]  Pierre Hansen,et al.  Variable Neighborhood Search : Methods and Applications , 2008 .

[10]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[11]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[12]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[13]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[14]  Rasaratnam Logendran,et al.  Scheduling unrelated parallel machines with sequence-dependent setups , 2007, Comput. Oper. Res..

[15]  P. Pardalos,et al.  Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search , 2007 .

[16]  Gilbert Laporte,et al.  Improvements to the Or-opt heuristic for the symmetric travelling salesman problem , 2007, J. Oper. Res. Soc..

[17]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[18]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[19]  Fariborz Jolai,et al.  A variable neighborhood search for job shop scheduling with set-up times to minimize makespan , 2009, Future Gener. Comput. Syst..

[20]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .