Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Vehicle routing problem --- Operations Research

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial optimization. --- Transportation problems (Programming) --- Vehicle routing problem.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.

Traveling-salesman problem. --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem --- Computer modelling & simulation

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The world is on the edge of an economical breakthrough with the emergence of autonomous
cars. Such vehicles do not, or for a very short time, require the driver’s attention or even not
require a driver at all. This new era of vehicles is largely promoted by Tesla’s eccentric CEO
Elon Musk and the promotion of the S 3 X Y series of vehicles which include an autopilot mode.
In parallel to the emergence of autonomous cars, autonomous trucks are also in development and
are likely to revolutionize the transport sector and in particular freight transport. Again, Tesla
wants to be a pioneer in this domain with the Tesla Semi, which is supposed to arrive around
2021 on the market. Autonomous vehicles are expected to improve road safety by drastically
reducing the number of incidents. Furthermore, they are likely to be an excellent ally in the fight
against climate change by improving the road transport efficiency and reducing greenhouse gas
emissions.
The aim of this work is to emphasize the gains of using autonomous trucks over regular
trucks for freight transport. These gains are mainly based on the prime costs of such trucks but
also, in a lesser extent, to the greenhouse gas emissions. To do so, two similar trucks, one with
a driver and an autonomous one, are compared for different delivery situations, from national to
international level. While the autonomous truck can drive continuously, the driver is submitted
to the European legislation on driving and working hours. Their respective journey, which visits
a set of n clients selected randomly, is computed by minimizing either the driving time or the
driving distance. To each route, a monetary cost is associated which serves as a basis for the
comparison between the two trucks.

Autonomous trucks, Vehicle routing problem, optimization --- Sciences économiques & de gestion > Production, distribution & gestion de la chaîne logistique

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W. R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem"--

Traveling salesman problem. --- Computational complexity. --- Complexity, Computational --- Electronic data processing --- Machine theory --- TSP (Traveling salesman problem) --- Combinatorial optimization --- Graph theory --- Vehicle routing problem