Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route

Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP

We considers greedy algorithms that allow partial regret. As an example we consider a variant of the cheapest insertion algorithm for the TSP. Our numerical study indicates that in most cases it significantly reduces the relative error, and the added computational time is quite small.

The Shortest Route

Heuristic estimates in shortest path algorithms

Shortest path problems occupy an important position in Operations Research as well as in Artificial Intelligence. In this paper we study shortest path algorithms that exploit heuristic estimates. The well-known algorithms are put into one framework. Besides we present an interesting application of binary numbers in the shortest path theory.

Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm

Automatic extraction and understanding of humangenerated route descriptions have been critical to research aiming at understanding human cognition of geospatial information. Among all research issues involved, road name disambiguation is the most important, because one road name can refer to more than one road. Compared with traditional toponym (place name) disambiguation, the challenges of dis...

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...