Abstract
The profitable arc tour problem is a variant in the vehicle routing problems. It is included in the family of the vehicle routing with profit 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. To solve this variant we adopted two metaheuristics based on adaptive memory. We show that our algorithms provide good results in terms of solution quality and running times.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Archetti C, Savelsbergh M-W-P and Speranza M-G (2008). To split or not to split: That is the question. Transport Res E 44: 114–123.
Balas E (1989). The prize collecting traveling salesman problem. Networks 19: 621–636.
Baldacci R, Bartolini E and Laporte G (2009). Some applications of the generalized vehicle routing problem. J Opl Res Soc 61: 1072–1077.
Bérubé J-F, Gendreau M and Potvin J-Y (2009). An exact ɛ-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. Eur J Opl Res 194: 39–50.
Brandão J (2009). A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. Eur J Opl Res 195: 716–728.
Butt S-E and Cavalier T-M (1994). A heuristic for the multiple tour maximum collection problem. Comput Opns Res 21: 101–111.
Butt S-E and Ryan D-M (1999). An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput Opns Res 26: 427–441.
Chao I-M, Golden B and Wasil E-A (1996a). The team orienteering problem. Eur J Opl Res 88: 464–474.
Chao I-M, Golden B and Wasil E-A (1996b). A fast and effective heuristic for the orienteering problem. Eur J Opl Res 88: 475–489.
Clossey J, Laporte G and Soriano P (2001). Solving arc routing problems with turn penalties. J Opl Res Soc 52: 433–439.
Corberán A, Mota E and Sanchis J-M (2006). A comparison of two different formulations for arc routing problems on mixed graphs. Comput Opns Res 33: 3384–3402.
Cordeau J-F and Laporte G (2003). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res B-Meth 37: 579–594.
Cordeau J-F, Laporte G and Mercier A (2001). A unified tabu search heuristic for vehicle routing problems with time windows. J Opl Res Soc 52: 928–936.
Dantzig GB and Ramser JH (1959). The truck dispatching problem. Manage Sci 6 (1): 80–91.
Euchi J and Chabchoub H (2009a). Tabu search metaheuristic embedded in adaptative memory procedure for the profitable arc tour problem. In: Abraham A (ed). IEEE Proceedings of Nature and Biologically Inspired Computing, NaBIC 2009, Coimbatore, India, 9–11 December, pp 204–209, http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5393689&isnumber=5393306.
Euchi J and Chabchoub H (2009b). Tabu search metaheuristic embedded in adaptive memory procedure for the profitable arc tour problem. 13th IFAC Symposium on Information Control Problems in Manufacturing, Volume# 13, Part# 1, Moscow, Russia, 3–5 June, pp 990–995, http://www.ifac-papersonline.net/Detailed/40746.html.
Euchi J and Chabchoub H (2010). A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem. Logist Res 2 (1): 3–11.
Euchi J, Chabchoub H and Yassine A (2010). Metaheuristics optimization via memory to solve the profitable arc tour problem. In: Hadj-Alouane AB and Pierreval H (eds). Proceedings of the 8th International Conference of Modeling and Simulation—MOSIM’10, 10–12 May, —Hammamet—Tunisia. http://www.enim.fr/mosim2010/articles/21.pdf.
Feillet D, Dejax P and Gendreau M (2005a). Travelling salesman problems with profits. Transport Sci 39: 188–205.
Feillet D, Dejax P and Gendreau M (2005b). The profitable arc tour problem: solution with a branch-and-price algorithm. Transport Sci 39: 539–552.
Gendreau M, Laporte G and Semet F (1998). A tabu search heuristic for the undirected selective travelling salesman problem. Eur J Opl Res 106: 539–545.
Glover F (1977). Heuristics for integer programming using surrogate constraints. Decision Sci 8: 156–166.
Glover F (2007). Tabu search—uncharted domains. Ann Opns Res 149: 89–98.
Golden BL, Laporte G and Taillard E-D (1997). An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Comput Opns Res 24: 445–452.
Golden BL, Assad AA and Wasil EA (2002). Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy and newspaper industries, the vehicle routing problem. In: Toth P and Vigo D (eds). SIAM Monographs on Discrete Mathematics and Applications. Society for International and Applied Mathematics: Philadelphia, pp 245–286.
Hansen P, Mladenovic N and Moreno-Pérez J-A (2008). Variable neighborhood search. Eur J Opl Res 191: 593–595.
Jozefowiez N, Semet F and Talbi E-G (2009). An evolutionary algorithm for the vehicle routing problem with route balancing. Eur J Opl Res 195: 761–769.
Rochat Y and Taillard E-D (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147–167.
Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications. Society for International and Applied Mathematics: Philadelphia.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Euchi, J., Chabchoub, H. Hybrid metaheuristics for the profitable arc tour problem. J Oper Res Soc 62, 2013–2022 (2011). https://doi.org/10.1057/jors.2010.179
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2010.179