Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
An Adaptive Tabu Search Heuristic For The Location Routing Pickup And Delivery Problem With Time Windows With A Theater Distribution Application, Robert E. Burks Jr.
An Adaptive Tabu Search Heuristic For The Location Routing Pickup And Delivery Problem With Time Windows With A Theater Distribution Application, Robert E. Burks Jr.
Theses and Dissertations
The time constrained pickup and delivery problem (PDPTW) is a problem of finding a set of routes for a fleet of vehicles in order to satisfy a set of transportation requests. Each request represents a user-specified pickup and delivery location. The PDPTW may be used to model many problems in logistics and public transportation. The location routing problem (LRP) is an extension of the vehicle routing problem where the solution identifies the optimal location of the depots and provides the vehicle schedules and distribution routes. This dissertation seeks to blend the PDPTW and LRP areas of research and formulate a …
A Group Theoretic Tabu Search Methodology For Solving The Theater Distribution Vehicle Routing And Scheduling Problem, John R. Crino
A Group Theoretic Tabu Search Methodology For Solving The Theater Distribution Vehicle Routing And Scheduling Problem, John R. Crino
Theses and Dissertations
The application of Group Theory to Tabu Search is a new and exciting field of research. This dissertation applies and extends some of Colletti's (1999) seminal work in group theory and metaheuristics in order to solve the theater distribution vehicle routing and scheduling problem (TDVRSP). This research produced a robust, efficient, effective and flexible generalized theater distribution model that prescribes the routing and scheduling of multi-modal theater transportation assets to provide economically efficient time definite delivery of cargo to customers. In doing so, advances are provided in the field of group theoretic tabu search and its application to difficult combinatorial …