Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Implementation of the Metaheuristic Tabu Search in Route Selection for Mobility Analysis Support System

Implementation of the Metaheuristic Tabu Search in Route Selection for Mobility Analysis Support System

Ryer, David M.

Paperback

General Education

ISBN10: 1288302584
ISBN13: 9781288302581
Publisher: Biblioscholar
Published: Nov 15 2012
Pages: 114
Weight: 0.48
Height: 0.24 Width: 7.44 Depth: 9.69
Language: English
This thesis employs a reactive tabu search heuristic implemented in the Java programming language to solve a real world variation of the vehicle routing problem with the objective of providing quality routes to Mobility Analysis Support System (MASS). MASS is a stochastic simulation model used extensively by Air Mobility Command (AMC) to analyze strategic airlift capabilities and future procurement decisions. This dynamic real world problem of strategic and tactical airlift possesses a number of side constraints such as vehicle capacities, route length and time windows in a sizeable network with multiple depots and a large fleet of heterogeneous vehicles. Finding optimal solutions to this problem is currently not practical. Currently, MASS requires all possible routes used in its simulation to be manually selected. As a result, the route selection process is a tedious and time consuming process that relies on experience and past performance of the model to obtain quality routes for the mobility system.

Also in

General Education

View All