Adaptive Memory Procedure to solve the Profitable Arc Tour Problem (original) (raw)

2010, Int. J. Comb. Optim. Probl. Informatics

Abstract

In this paper we propose an Adaptive Memory Procedure to solve the Profitable Arc Tour Problem (PATP). The PATP is a variant of the well-known Vehicle Routing Problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. Computational experiments show that our algorithms provide good results in terms of quality of solution and running times.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (24)

  1. Pereira, F.B., Tavares, J., Machado, P. and Costa, E.: GVR: A New Genetic Representation for the Vehicle Routing Problem, Lecture Notes In Computer Science, Proceedings of the 13th Irish International Conference on Artificial Intelligence and Cognitive Science (2002) 95-102. GS Search. CrossRef.
  2. Dantzig, G.B. and Ramser, J.H.: The Truck Dispatching Problem. Management Science, Vol. 6, No. 1 (1959) 80-91. Stable URL: View Item. GS Search.
  3. Toth, P. and Vigo, D. : The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002). GS Search.
  4. Golden, B.L., Assad, A.A. and Wasil, E.A.: Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy and Newspaper Industries. The Vehicle Routing Problem, Toth, P. and Vigo, D. (Editors), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002) 245-286. GS Search.
  5. Corberán, A., Mota, E. and Sanchis, J.M.: A Comparison of two Different Formulations for Arc Routing Problems on Mixed Graphs. Computers & Operations Research, Vol. 33, No. 12 (2006) 3384-3402. GS Search. CrossRef.
  6. Jozefowiez, N., Semet, F. and Talbi, E.G.: An Evolutionary Algorithm for the Vehicle Routing Problem with Route Balancing. European Journal of Operational Research, Vol. 195, No. 3 (2009) 761-769. GS Search. CrossRef.
  7. Feillet, D., Dejax, P. and Gendreau, M.: The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm. Transportation Science, Vol. 39, No. 4 (2005) 539-552. GS Search.
  8. Gendreau, M., Laporte, G. and Semet, F.: A Tabu Search Heuristic for the Undirected Selective Travelling Salesman Problem. European Journal of Operational Research, Vol. 106, No. 2-3 (1998) 539-545. GS Search. CrossRef.
  9. Chao, I-M., Golden, B. and Wasil, E.A.: A Fast and Effective Heuristic for the Orienteering Problem. European Journal of Operational Research, Vol. 88, No. 3 (1996) 475-489. GS Search. CrossRef.
  10. Butt, S.E. and Ryan, D.M.: An Optimal Solution Procedure for the Multiple Tour Maximum Collection Problem using Column Generation. Computers and Operations Research, Vol. 26, No. 4 (1999) 427-441. GS Search. CrossRef.
  11. Balas, E.: The Prize Collecting Travelling Salesman Problem. Networks, Vol. 19 (1989) 621-636. GS Search.
  12. Feillet, D., Dejax, P. and Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science, Vol. 39, No. 2 (2005) 188-205. GS Search. CrossRef.
  13. Bérubé, J-F., Gendreau, M. and Potvin, J-Y.: An Exact ε-constraint Method for bi-objective Combinatorial Optimization Problems: Application to the Travelling Salesman Problem with Profits. European Journal of Operational Research, Vol. 194 (2009) 39-50. GS Search. CrossRef.
  14. Chao, I-M., Golden, B.L. and Wasil, E.A.: The Team Orienteering Problem. European Journal of Operational Research, Vol. 88, No. 3 (1996) 464-474. GS Search. CrossRef.
  15. Butt, S.E. and Cavalier, T.M.: A Heuristic for the Multiple Tour Maximum Collection Problem. Computers and Operations Research, Vol. 21, No. 1 (1994) 101-111. GS Search. CrossRef.
  16. Euchi, J. and Chabchoub, H.: Tabu Search Metaheuristic Embedded in Adaptative Memory Procedure for the Profitable Arc Tour Problem. IEEE proceedings of World Congress on Nature and Biologically Inspired Computing 2009. NaBIC 2009 (2009) 204-209. CrossRef.
  17. Glover, F.: Tabu Search-Uncharted Domains. Annals of Operations Research, Vol. 149, No. 1 (2007) 89-98. GS Search. CrossRef.
  18. Mladenovic, N. and Hansen P.: Variable Neighborhood Search. European Journal of Operational Research Vol. 24, No. 11 (1997) 593-595. GS Search. CrossRef.
  19. Archetti, C., Savelsbergh, M.W.P, Speranza, M.G.: To Split or not to Split: That is the Question. Transportation Research Part E, Vol. 44, No. 1 (2008) 114-123. GS Search. CrossRef.
  20. Golden, B.L., Laporte, G. and Taillard, E.D. : An Adaptive Memory Heuristic for a class of Vehicle Routing Problems with minmax Objective. Computers & Operations Research, Vol. 24, No. 5 (1997) 445-452. GS Search. CrossRef.
  21. Rochat, Y. and Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of heuristics, Vol. 1, No. 1 (1995) 147-167. GS Search. CrossRef.
  22. Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences, Vol. 8, No. 1 (1977) 156- 166. GS Search.
  23. Cordeau, J-F. and Laporte, G.: A Tabu Search Heuristic for the Static Multi-Vehicle Dial-a-ride Problem. Transportation Research Part B: Methodological, Vol. 37, No. 6 (2003) 579-594. GS Search. CrossRef.
  24. Brandão, J.: A Deterministic Tabu Search Algorithm for the Fleet Size and mix Vehicle Routing Problem. European Journal of Operational Research, Vol. 195, No. 3 (2009) 716-728. GS Search. CrossRef.