Constrained time-critical routing for multiple mobile agents

Cardinal Scholar

Show simple item record

dc.contributor.advisor Wu, Shaoen, 1976-
dc.contributor.author Felemban, Ola Abdulrazzak
dc.date.accessioned 2017-05-09T13:25:42Z
dc.date.available 2017-05-09T13:25:42Z
dc.date.issued 2017-05-06
dc.identifier.uri http://cardinalscholar.bsu.edu/handle/123456789/200702
dc.description.abstract In the Information Era, integrating technology with the real-­‐world environment is a trending paradigm that attracts researchers in many fields. For example, Smart Cities’ applications integrate information technology with existing infrastructures to optimize many aspects, such as time, energy, and cost. However, many difficulties show up, including a time constraint in some of the applications when it is implemented in the real world. One of these applications is smart transportation. This thesis explores Vehicle Routing Problem (VRP) and introduces a variant of VRP that relates to time constraints called VRP with Time Window (VRPTW). Firstly, the problem is formulated into a linear mathematic program with the objective of minimizing the number of agents used in routing and minimizing the time spent in agents’ routing. A heuristic approach solves this problem by using a combined of A* Search and Ruin and Recreate algorithms to find the shortest path for agents. Additionally, the Local Search Algorithm is used to minimize the number of agents used in routing. Two case studies test this heuristic approach: a case study in changing number of nodes, and a case study in changing nodes’ duration. The results are represented in numbers to show the reduced number of agents and time cost, while graph plots show the agents’ routings. en_US
dc.description.sponsorship Department of Computer Science
dc.description.tableofcontents Background -- Methodologies and design -- Hueristic approach -- Simulation results.
dc.subject.lcsh Vehicle routing problem -- Mathematical models.
dc.subject.lcsh Mobile agents (Computer software) -- Mathematical models.
dc.subject.lcsh Vehicle-infrastructure integration -- Mathematical models.
dc.title Constrained time-critical routing for multiple mobile agents en_US
dc.description.degree Thesis (M.S.) en_US
dc.identifier.cardcat-url http://liblink.bsu.edu/uhtbin/catkey/1851502


Files in this item

This item appears in the following Collection(s)

  • Master's Theses [5510]
    Master's theses submitted to the Graduate School by Ball State University master's degree candidates in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


Browse

My Account