Spelling suggestions: "subject:"shortest route"" "subject:"shortest toute""
1 |
Network based heuristics for the set covering problemDjannaty, Farhad January 1997 (has links)
No description available.
|
2 |
Traveler Centric Trip Planning: A situation-Aware SystemAmar, Haitham January 2012 (has links)
Trip planning is a well cited problem for which various solutions have been reported in the literature. This problem has been typically addressed, to a large extent, as a shortest distance path planning problem. In some scenarios, the concept of shortest path is extended to reflect temporal objectives and/or constraints. This work takes an alternative perspective to the trip planning problem in the sense it being situation aware. Thus, allowing multitudes of traveler centric objectives and constraints, as well as aspects of the environment as they pertain to the trip and the traveler. The work in this thesis introduces TSADA (Traveler Situation Awareness and Decision Aid) system. TSADA is designed as a modular system that combines linguistic situation assessment with user-centric decision-making.
The trip planning problem is modeled as a graph G. The objective is to find a route with the minimum cost. Both hard and soft objective/attributes are incorporated. Soft objective/attributes such as safety, speed and driving comfortability are described using a linguistic framework and processed using hierarchical fuzzy inference engine. A user centric situation assessment is used to compute feasible routes and map them into route recommendation scheme: recommended, marginally recommended, and not recommended.
In this work, we introduce traveler's doctrines concept. This concept is proposed to make the process of situation assessment user centric by being driven by the doctrine that synthesizes the user's specific demands. Hard attributes/objectives, such as the time window and trip monitory allowances, are included in the process of determining the final decision about the trip. We present the underline mathematical formulation for this system and explain the working of the proposed system to achieve optimal performance. Results are introduced to show how the system performs under a wide range of scenarios. The thesis is concluded with a discussion on findings and recommendations for future work.
|
3 |
Traveler Centric Trip Planning: A situation-Aware SystemAmar, Haitham January 2012 (has links)
Trip planning is a well cited problem for which various solutions have been reported in the literature. This problem has been typically addressed, to a large extent, as a shortest distance path planning problem. In some scenarios, the concept of shortest path is extended to reflect temporal objectives and/or constraints. This work takes an alternative perspective to the trip planning problem in the sense it being situation aware. Thus, allowing multitudes of traveler centric objectives and constraints, as well as aspects of the environment as they pertain to the trip and the traveler. The work in this thesis introduces TSADA (Traveler Situation Awareness and Decision Aid) system. TSADA is designed as a modular system that combines linguistic situation assessment with user-centric decision-making.
The trip planning problem is modeled as a graph G. The objective is to find a route with the minimum cost. Both hard and soft objective/attributes are incorporated. Soft objective/attributes such as safety, speed and driving comfortability are described using a linguistic framework and processed using hierarchical fuzzy inference engine. A user centric situation assessment is used to compute feasible routes and map them into route recommendation scheme: recommended, marginally recommended, and not recommended.
In this work, we introduce traveler's doctrines concept. This concept is proposed to make the process of situation assessment user centric by being driven by the doctrine that synthesizes the user's specific demands. Hard attributes/objectives, such as the time window and trip monitory allowances, are included in the process of determining the final decision about the trip. We present the underline mathematical formulation for this system and explain the working of the proposed system to achieve optimal performance. Results are introduced to show how the system performs under a wide range of scenarios. The thesis is concluded with a discussion on findings and recommendations for future work.
|
4 |
Geoinformační systém pro zrakově postižené / Geoinformation system for the visually handicappedŠupák, Jakub January 2018 (has links)
Diploma thesis named "Geoinformation system for the visually handicapped" deals with design and creation geoinformation system that should serve to visually handicapped people with planing the most appropriate route and their movement in a city. First part of thesis is a brief summary of who are visually handicapped people, their needs, abilities and principles of movement. Further are described barrier-free adaptations for visually handicapped people and existing solutions. Practical output is the design of an algorithm for automatically locating and evaluating critical locations based on OpenStreetMaps solution. Visually handicapped people choose not shortest route, but the safest route for their movement. Key words: Critical Point, Visual Handicap, Shortest Route, Optimization, Routing
|
5 |
Navigace pomocí turistické mapy / Navigation using a turistic mapMihál, Jakub January 2012 (has links)
The master’s thesis deals with the design and realization of a program that is able to find the shortest route in the tourist map between selected points. The user can select the type of hiking trail. Application also generates terrain heightmap from contour lines and path elevation profile.
|
6 |
Land Leveling Using Optimal Earthmoving Vehicle RoutingMcInvale, Howard D. 30 April 2002 (has links)
This thesis presents new solution approaches for land leveling, using optimal earthmoving vehicle routing. It addresses the Shortest Route Cut and Fill Problem (SRCFP) developed by Henderson, Vaughan, Wakefield and Jacobson [2000]. The SRCFP is a discrete optimization search problem, proven to be NP-hard. The SRCFP describes the process of reshaping terrain through a series of cuts and fills. This process is commonly done when leveling land for building homes, parking lots, etc. The model used to represent this natural system is a variation of the Traveling Salesman Problem. The model is designed to limit the time needed to operate expensive, earthmoving vehicles. The model finds a vehicle route that minimizes the total time required to travel between cut and fill locations while leveling the site. An optimal route is a route requiring the least amount of travel time for an individual earthmoving vehicle.
This research addresses the SRCFP by evaluating minimum function values across an unknown response surface. The result is a cost estimating strategy that provides construction planners a strategy for contouring terrain as cheaply as possible. Other applications of this research include rapid runway repair, and robotic vehicle routing. / Master of Science
|
Page generated in 0.0336 seconds