Genetic algorithm for the one-commodity pickupand-delivery vehicle routing problem

Proceedings - 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, ICIS 2009

Volumn 1, Issue , 2009, Pages 175-179

  Shi, Xiaoyan ^a   Zhao, Fanggeng ^a   Gong, Yancheng ^a  

^a Automobile Management Institute   (China)

Author keywords

Genetic algorithm; Pheromone based crossover; Pickup and delivery; Vehicle routing problem

Indexed keywords

CROSSOVER OPERATOR; PHEROMONE-BASED CROSSOVER; PICKUP AND DELIVERY;

GENETIC ALGORITHMS; INTELLIGENT COMPUTING; INTELLIGENT SYSTEMS; MATHEMATICAL MODELS; ROUTING ALGORITHMS;

MATHEMATICAL OPERATORS;

EID: 77949592087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICISYS.2009.5357913     Document Type: Conference Paper

References (17)

1. H. Hernández-Pérez, and J.J. Salazar González, "A branch-and-cut algorithm for a Traveling Salesman Problem with Pickup and Delivery," Discrete Applied Mathematics, vol. 145, pp. 126-139, Dec. 2004.
2. H. Hernández-Pérez and J.J. Salazar González, "Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem," Transportation Science, vol. 38, pp. 245-255, Feb. 2004.
3. H. Hernández-Pérez, and J.J. Salazar González, "The one-commodity pickup and delivery traveling salesman problem: Inequalities and algorithms," Networks, vol. 50, pp. 258-272, April 2007.
4. H. Hernández-Pérez, I. Rodríguez-Martín, and J.J. Salazar González, "A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem," Computers & Operations Research, doi: 10.1016/j.cor.2008.03.008, 2008.
5. F. G. Zhao, S. J. Li, J. S. Sun, and D. Mei, "Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem," Computers & Industrial Engineering, vol. 56, pp. 1642-1648, May 2009.
6. G. Nagy, and S. Salhi, "Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries," European Journal of Operational Research, vol. 162, pp. 126-141, Jan. 2005.
7. J. Holland, "Adaptation in Natural and Artificial Systems," The University of Michigan Press, Ann Arbour, 1975.
8. L. V. Snyder, and M. S. Daskin, "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, vol. 174, pp. 38-53, Jan 2006.
9. A. Misevicius, "An improved hybrid genetic algorithm: new results for the quadratic assignment problem," Knowledge-Based Systems, vol. 17, pp. 65-73, Feb. 2004.
10. B.M. Baker, and M.A. Ayechew, "A genetic algorithm for the vehicle routing problem," Computers & Operations Research, vol. 30, pp. 787-800, May 2003.
11. B. J. Park, H. R. Choi, and H. S. Kim, "A hybrid genetic algorithm for the job shop scheduling problems," Computers & Industrial Engineering, vol. 45, pp. 597-613, Dec. 2003.
12. S. D. Shtovba, "Ant algorithms: theory and applications," Programming and Computer Software, vol. 31, pp. 167-178, April 2005.
13. M.W.P. Savelsbergh, "The vehicle routing problem with time windows: minimizing route duration," INFORMS Journal on Computing, vol. 4, pp. 146-154, Jan 1992.
14. J.Y. Potvin, and J.M. Rousseau, "An exchange heuristic for routing problems with time windows," Journal of the Operational Research Society, vol. 46, pp. 1433-1446, Dec. 1995.
15. M.M. Flood, "The traveling-salesman problem," Operations Research, vol. 4, pp. 61-75, Jan 1956.
16. T. Stützle, and H. Hoos, "MAX-MIN Ant System," Future Generation Computer Systems, vol. 16, pp. 889-914, Jun 2000.
17. L.M. Gambardella, and M. Dorigo, "Solving symmetric and asymmetric TSPs by ant colonies," Proc. the IEEE Int. Conf. on Evo. Comp.(ICEC'96), pp. 622-627, 1996.