A comprehensive benchmark set and heuristics for the traveling thief problem
暂无分享,去创建一个
Zbigniew Michalewicz | Markus Wagner | Sergey Polyakovskiy | Frank Neumann | Mohammad Reza Bonyadi | Z. Michalewicz | M. Bonyadi | F. Neumann | S. Polyakovskiy | Markus Wagner
[1] Adam Wierzbicki,et al. Socially inspired algorithms for the travelling thief problem , 2014, GECCO.
[2] Sai Ho Chung,et al. Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..
[3] Bahar Yetis Kara,et al. Energy Minimizing Vehicle Routing Problem , 2007, COCOA.
[4] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[5] Zbigniew Michalewicz,et al. The travelling thief problem: The first step in the transition from theoretical problems to realistic problems , 2013, 2013 IEEE Congress on Evolutionary Computation.
[6] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[7] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[8] Nursel Öztürk,et al. A Green Capacitated Vehicle Routing Problem with Fuel Consumption Optimization Model , 2013 .