Solving reverse logistics vehicle routing problems with time windows

A vehicle routing problem with simultaneous pick-up and delivery in closed-loop logistics network optimization is studied in this paper. Since, in practice, material pick-up and delivery are only allowed to take place on certain time periods, we consider the reverse logistics vehicle routing problem with time windows. A mixed integer programming model is proposed to formulate the considered problem. A heuristic solution approach for solving the model is developed due to the NP-hard nature of solving the model. The heuristic solution is then used as an initial solution of a simulated annealing procedure for improved solutions. The proposed heuristic method and the simulated annealing procedure yield very promising solutions in much less computational time when compared with optimal solutions generated by exact solution procedures. Numerical examples are presented to illustrate the developed model and solution methods.

[1]  Humberto Cesar Brandao de Oliveira,et al.  A Robust Method for the VRPTW with Multi-Start Simulated Annealing and Statistical Analysis , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[2]  Miao Li-xin,et al.  A new Tabu Search heuristic algorithm for the Vehicle Routing Problem with Time Windows , 2008, 2008 International Conference on Management Science and Engineering 15th Annual Conference Proceedings.

[3]  Enrico Angelelli,et al.  The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery , 2002 .

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

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

[6]  Haijun Mao,et al.  INTEGRATION OF FORWARD AND REVERSE LOGISTICS AT THE VEHICLE ROUTING LEVEL , 2007 .

[7]  Yuanbiao Zhang,et al.  A particle swarm optimization algorithm with crossover for vehicle routing problem with time windows , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

[8]  J Dethloff,et al.  Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls , 2002, J. Oper. Res. Soc..

[9]  Giovanni Righini,et al.  Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..

[10]  T. T. Narendran,et al.  TASTE: a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up , 2008 .

[11]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[12]  Brian Kallehauge,et al.  Formulations and exact algorithms for the vehicle routing problem with time windows , 2008, Comput. Oper. Res..

[13]  Lai Ming-yong,et al.  An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows , 2010, Eng. Appl. Artif. Intell..

[14]  Bruce L. Golden,et al.  VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[15]  Ming-yong Lai,et al.  Vehicle Routing Problem with Simultaneous Delivery and Pick-up with Time Windows , 2007 .

[16]  Hua Xuan,et al.  A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time , 2006, Comput. Oper. Res..

[17]  Andrew Lim,et al.  Local search with annealing-like restarts to solve the VRPTW , 2003, Eur. J. Oper. Res..

[18]  Said Salhi,et al.  A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..

[19]  Houkuan Huang,et al.  An Ant Colony System Based Heuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pickup , 2007, 2007 2nd IEEE Conference on Industrial Electronics and Applications.

[20]  Shih-Wei Lin,et al.  Vehicle Routing Problems with Time Windows Using Simulated Annealing , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[21]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[22]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[23]  Fei Qiao,et al.  An Improved Genetic Algorithm for Vehicle Routing Problem with Time-Window , 2008, 2008 International Symposium on Computer Science and Computational Technology.

[24]  L. V. Wassenhove,et al.  Quantitative approaches to distribution logistics and supply chain management , 2002 .

[25]  J-F Chen,et al.  Vehicle routing problem with simultaneous deliveries and pickups , 2006, J. Oper. Res. Soc..

[26]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[27]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[28]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[29]  Mingyong Lai,et al.  An Improved Differential Evolution Algorithm for the Vehicle Routing Problem With Simultaneous Delivery and Pick-up Service , 2007, Third International Conference on Natural Computation (ICNC 2007).

[30]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[31]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.