240
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Routing problems: a historical perspective

, &
Pages 118-127 | Published online: 27 May 2011
 

Abstract

This paper presents an historical perspective on routing problems. Today a well-established class of optimization problems, routing problems have played a pivotal role in the development of Logistics as a discipline, even influencing other sectors not directly connected to management studies. The aim of this paper is to provide an overview of the evolution of this topic, starting from seminal contributions by Euler and Hamilton, and illustrating the most recent applications. This article is based on a longer article originally published in Italian (Bruno et al. Citation2010).

Notes

1 Some details about Königsberg city life during the eighteenth century can be found in the novel Critica della Ragion Criminale, by Michael Gregorio (alias Michael Jacob and Daniela De Gregorio), Einaudi, 2006. One of the main characters of the novel is the philosopher Immanuel Kant.

2 If the graph that represents the problem is connected and all the vertices have even degree, an Eulerian circuit exists. Euler also showed that a path exists if the graph has only two vertices with odd degree, in which case the path must depart from one of these two vertices.

3 Also sometimes known as the Route Inspection Problem (RIP). Goldman affirms, in a personal note dated 14 December 2003, that he was influenced in selecting the name of the problem by the title of a noir novel by Ellery Quen, The Chinese orange mystery (1934).

4 According to the original rules, up to 15 different games could be implemented. Hamilton's idea was that two people could compete against each other, the first by selecting the version of the game and setting up the rules, the second by solving it. Hamilton (Citation1856, Citation1858) also developed a discipline that he named Icosian Calculus, which he utilized to investigate closed paths on dodecahedrons

5 When a Hamiltonian path has an arc that connects the last vertex to the first one, it is called a Hamiltonian Circuit.

6 Morton and Land (Citation1955) state that the TSP was originally named the Laundry Van Problem.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.