A practical solution using simulated annealing for general routing problems with nodes, edges, and arcs

Authors:
Hisafumi Kokubugata;Ayako Moriyama;Hironao Kawashima
Affiliations:
Department of Administration Engineering, Keio University, Hiyoshi, Yokohama, Japan;Department of Administration Engineering, Keio University, Hiyoshi, Yokohama, Japan;Department of Administration Engineering, Keio University, Hiyoshi, Yokohama, Japan
Venue:
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Year:
2007

Citing 5
Cited 1

Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
Arc routing in a node routing environment

Computers and Operations Research

A lower bound for the Node, Edge, and Arc Routing Problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.