Abstract
A new practical solution of the general routing problems with nodes, edges, and arcs (NEARP) has been developed. The method is characterized by a primitive data modeling and a simple optimization procedure based on simulated annealing. The data structure of the method, that is traveling routes of a number of vehicles, is expressed as a string. The solutions generated by the proposed method are compared with those of another method by conducting computational experiments on instances of the NEARP. Moreover, it is shown that the proposed method is adaptable to additional conditions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Japan Petroleum Energy Center: Study on CO2 emissions from automobiles and refineries. In: CO2 emissions study WG report in 4th JCAP Conference (2005), http://www.pecj.or.jp/english/jcap/pdf/JCAP200506/2_3e.pdf
Kokubugata, H., Itoyama, H., Kawashima, H.: Vehicle Routing Methods for City Logistics Operations. In: Preprint for IFAC Symposium on Transportation Systems, pp. 727–732 (1997)
Hasama, T., Kokubugata, H., Kawashima, H.: A Heuristic Approach Based on the String Model to Solve Vehicle Routing Problem with Backhauls. In: Preprint for 5th Annual World Congress on Intelligent Transport Systems, No.3025 (1998)
Hasama, T., Kokubugata, H., Kawashima, H.: A Heuristic Approach Based on the String Model to Solve Vehicle Routing Problem with Various Conditions. In: Preprint for 6th World Congress on Intelligent Transport Systems, No.3027 (1999)
Hertz, A., Laporte, G., Mittaz, M.: A Tabu Search Heuristic for the Capacitated Arc Routing Problem. Operations Research 48, 129–135 (2000)
Lacomme, P., Prins, C., Ramdane-Cherif, W.: A Genetic Algorithm for the Capacitated Arc Routing Problem and its Extensions. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 473–483. Springer, Heidelberg (2001)
Kokubugata, H., Hirashima, K., Kawashima, H.: A Practical Solution of Capacitated Arc Routing for City Logistics. In: Proceeding of 11th IFAC Symposium on Control in Transportation Systems, No.222 (2006)
Prins, C., Bouchenoua, S.: A Memetic Algorithm Solving the VRP, the CARP and more General Routing Problems with Nodes, Edges and Arcs. In: Hart, W., Kranogor, N., Smith, J. (eds.) Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing, vol. 166, pp. 65–85. Springer, Heidelberg (2004)
Oppen, J., Lokketangen, A.: Arc Routing in a Node Routing Environment. Computers & Operations Research 33, 1033–1055 (2006)
Crescenzi, P., Kann, V.: A Compendium of NP Optimization Problem. Web site: http://www.nada.kth.se/~viggo/wwwcompendium/node103.html
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation, part I, graph partitioning. Operations Research 37, 865–892 (1989)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation, part II, graph coloring and number partitioning. Operations Research 39, 378–406 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kokubugata, H., Moriyama, A., Kawashima, H. (2007). A Practical Solution Using Simulated Annealing for General Routing Problems with Nodes, Edges, and Arcs. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)