A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows

A process for the manufacture of dimensionally stable polyurethane foams by releasing, and curing by interaction with the atmosphere, a mixture, which is under pressure, of prepolymers, containing isocyanate groups, and blowing agents, with or without assistants and additives, wherein the prepolymers, containing isocyanate groups, are obtained by reaction of organic polyisocyanates with difunctional to octafunctional polyester-polyols and/or polyether-polyols, containing chemically bonded tertiary amino groups in the polymer chain, or, preferably, with mixtures of such polyester-polyols and/or polyether-polyols and nitrogen-free polyester-polyols and/or polyether-polyols.

[1]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[2]  Shen Lin Computer solutions of the traveling salesman problem , 1965 .

[3]  Yuichi Nagata Efficient evolutionary algorithm for the vehicle routing problem with time windows: edge assembly crossover for the VRPTW , 2007, 2007 IEEE Congress on Evolutionary Computation.

[4]  Leon G. Higley,et al.  Forensic Entomology: An Introduction , 2009 .

[5]  Hideki Hashimoto,et al.  An iterated local search algorithm for the time-dependent vehicle routing problem with time windows , 2008, Discret. Optim..

[6]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[7]  Michel Gendreau,et al.  Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[8]  Toshihide Ibaraki,et al.  Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints , 2005, Transp. Sci..

[9]  Olli Bräysy,et al.  Active guided evolution strategies for large-scale vehicle routing problems with time windows , 2005, Comput. Oper. Res..

[10]  Wout Dullaert,et al.  A multi-start local search algorithm for the vehicle routing problem with time windows , 2004, Eur. J. Oper. Res..

[11]  Hiroshi Imai,et al.  A PATH-EXCHANGE-TYPE LOCAL SEARCH ALGORITHM FOR VEHICLE ROUTING AND ITS EFFICIENT SEARCH STRATEGY , 2000 .

[12]  Jörg Homberger,et al.  A two-phase hybrid metaheuristic for the vehicle routing problem with time windows , 2005, Eur. J. Oper. Res..

[13]  Russell Bent,et al.  Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows , 2007, AAAI.

[14]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[15]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[16]  Guy Desaulniers,et al.  A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows , 2009, Networks.

[17]  Jean-Yves Potvin,et al.  The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..

[18]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[19]  Teodor Gabriel Crainic,et al.  A guided cooperative search for the vehicle routing problem with time windows , 2005, IEEE Intelligent Systems.

[20]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[21]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[22]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[23]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[24]  Toshihide Ibaraki,et al.  An iterated local search algorithm for the vehicle routing problem with convex time penalty functions , 2008, Discret. Appl. Math..

[25]  Sandip Sen,et al.  Aggressive pricing to exploit market niches in supply chains , 2005, IEEE Intelligent Systems.

[26]  Jörg Homberger,et al.  A parallel two-phase metaheuristic for routing problems with time windows , 2001 .