Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
暂无分享,去创建一个
Xiaolan Xie | Ran Liu | Vincent Augusto | Carlos Rodríguez-Verjan | Xiaolan Xie | V. Augusto | Ran Liu | Carlos Rodríguez-Verjan
[1] Emmanouil E. Zachariadis,et al. A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints , 2009, Eur. J. Oper. Res..
[2] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..
[3] Giovanni Righini,et al. Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery , 2007, Comput. Oper. Res..
[4] Saïd Salhi,et al. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries , 2005, Eur. J. Oper. Res..
[5] Reza Tavakkoli-Moghaddam,et al. A memetic algorithm for a vehicle routing problem with backhauls , 2006, Appl. Math. Comput..
[6] Haldun Süral,et al. The single‐vehicle routing problem with unrestricted backhauls , 2003, Networks.
[7] Hironao Kawashima,et al. A HEURISTIC APPROACH BASED ON THE STRING MODEL TO SOLVE VEHICLE ROUTING PROBLEM WITH BACKHAULS , 1998 .
[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] Marc Reimann,et al. Comparing backhauling strategies in vehicle routing using Ant Colony Optimization , 2006, Central Eur. J. Oper. Res..
[10] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[11] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[12] Zhi-Long Chen,et al. Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..
[13] Jean-Yves Potvin,et al. Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..
[14] Yuvraj Gajpal,et al. Multi-ant colony system (MACS) for a vehicle routing problem with backhauls , 2009, Eur. J. Oper. Res..
[15] Niaz A. Wassan,et al. A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .
[16] Richard F. Hartl,et al. Variable neighborhood search for the dial-a-ride problem , 2010, Comput. Oper. Res..
[17] Gilbert Laporte,et al. A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..
[18] 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..
[19] Gilbert Laporte,et al. Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.
[20] David Pisinger,et al. Scheduling Transportation of Live Animals to Avoid the Spread of Diseases , 2004, Transp. Sci..
[21] Gilbert Laporte,et al. A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..
[22] Gilbert Laporte,et al. Static pickup and delivery problems: a classification scheme and survey , 2007 .
[23] Sophie N. Parragh,et al. A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .
[24] Andrew Lim,et al. A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.
[25] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[26] Paolo Toth,et al. Heuristic Algorithms for the Handicapped Persons Transportation Problem , 1997, Transp. Sci..
[27] Maged M. Dessouky,et al. A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows , 2006, Eur. J. Oper. Res..
[28] Richard F. Hartl,et al. Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows , 2002, Ant Algorithms.
[29] Yuvraj Gajpal,et al. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup , 2009, Comput. Oper. Res..
[30] Michel Gendreau,et al. A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.
[31] Sylvie Gélinas,et al. A new branching strategy for time constrained routing problems with application to backhauling , 1992, Ann. Oper. Res..
[32] Michael H. Cole,et al. A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION , 2005 .
[33] Abdul Razak Hamdan,et al. Ant Colony System , 2013 .
[34] Jonathan F. Bard,et al. A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..
[35] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[36] Paolo Toth,et al. An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..
[37] Roberto Baldacci,et al. An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.
[38] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[39] Voratas Kachitvichyanukul,et al. A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..
[40] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[41] Giselher Pankratz,et al. A Grouping Genetic Algorithm for the Pickup and Delivery Problem with Time Windows , 2005, OR Spectr..
[42] Roberto Baldacci,et al. An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..
[43] Said Salhi,et al. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling , 1999, J. Oper. Res. Soc..
[44] Jean-Yves Potvin,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..
[45] Mauro Dell'Amico,et al. Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method , 1999, J. Heuristics.
[46] Maged Dessouky,et al. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows , 2004 .
[47] J. Mitchell. Branch and Cut , 2011 .
[48] Jean-Yves Potvin,et al. Vehicle Routing , 2009, Encyclopedia of Optimization.
[49] Hsiao-Fan Wang,et al. A genetic algorithm for the simultaneous delivery and pickup problems with time window , 2012, Comput. Ind. Eng..
[50] Bernard Fortz,et al. A Branch-and-Cut Algorithm , 2000 .
[51] 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..
[52] Jean-Yves Potvin,et al. A tabu search heuristic for the vehicle routing problem with private fleet and common carrier , 2009, Eur. J. Oper. Res..
[53] Hokey Min,et al. The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .
[54] Oli B. G. Madsen,et al. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..
[55] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[56] Enrico Angelelli,et al. The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery , 2002 .
[57] Kenneth Sörensen,et al. MA mid PM: memetic algorithms with population management , 2006, Comput. Oper. Res..
[58] Lúcia Maria de A. Drummond,et al. A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery , 2010, Comput. Oper. Res..
[59] Gilbert Laporte,et al. A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-Ride Problem , 2002 .
[60] Jean-François Cordeau,et al. A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..
[61] Mingyong Lai,et al. An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows , 2010, Eng. Appl. Artif. Intell..
[62] Daniel Granot,et al. The vehicle routing problem with pickups and deliveries on some special graphs , 2002, Discret. Appl. Math..
[63] Hermann Gehring,et al. A Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows , 1999 .
[64] J-F Chen,et al. Vehicle routing problem with simultaneous deliveries and pickups , 2006, J. Oper. Res. Soc..
[65] Julia Abelson,et al. What is important to continuity in home care?. Perspectives of key stakeholders. , 2004, Social science & medicine.
[66] Candace Arai Yano,et al. Vehicle Routing at Quality Stores , 1987 .
[67] Nigel H. M. Wilson,et al. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .
[68] Jacques Desrosiers,et al. The Pickup and Delivery Problem with Time Windows , 1989 .
[69] Giovanni Righini,et al. A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..
[70] M. Goetschalckx,et al. The vehicle routing problem with backhauls , 1989 .
[71] José Brandão,et al. Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls , 2005, J. Oper. Res. Soc..
[72] Said Salhi,et al. An ant system algorithm for the mixed vehicle routing problem with backhauls , 2004 .
[73] Paolo Toth,et al. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..
[74] Christian Prins,et al. A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..