Abstract/Details

On the routing and location of mobile facilities


2010 2010

Other formats: Order a copy

Abstract (summary)

Mobile facilities play important roles in many applications, including health care, public services, telecommunications, and humanitarian relief logistics. While mobile facilities operate in different manners, it is generally considered important for a decision maker to be capable of efficiently deploying mobile facilities. This dissertation discusses two problems on the use of mathematical models and algorithms for determining efficient deployments of mobile facilities.

First we discuss the mobile facility routing problem (MFRP), which effectively models the operations of a wide class of mobile facilities that have significant relocation times and cannot service demand during transit. Chapter 2 discusses the single MFRP (SMFRP), which is to determine a route for a single mobile facility to maximize the demand serviced during a continuous-time planning horizon. We present two exact algorithms, and supporting theoretical results, when the rate demand is generated is modeled using piecewise constant functions. The first is a dynamic program that easily extends to solve cases where the demand functions take on more general forms. The second exact algorithm has a polynomial worst-case runtime.

Chapter 3 discusses the MFRP, which addresses the situation when multiple mobile facilities are operating in an area. In such a case, mobile facilities at different locations may provide service to a single event, necessitating the separation of the events generating demand from the locations mobile facilities may visit in our model. We show that the MFRP is NP-hard, present several heuristics for generating effective routes, and extensively test these heuristics on a variety of simulated data sets.

Chapter 4 discusses formulations and local search heuristics for the (minisum) mobile facility location problem (MFLP). This problem is to relocate a set of existing facilities and assign clients to these facilities while minimizing the movement costs of facilities and clients. We show that in a certain sense the MFLP generalizes the uncapacitated facility location and p-median problems. We observe that given a set of facility destinations, the MFLP decomposes into two polynomially solvable subproblems. Using this decomposition observation, we propose a new, compact IP formulation and novel local search heuristics. We report results from extensive computational experiments.

Indexing (details)


Subject
Applied Mathematics;
Mathematics;
Operations research
Classification
0364: Applied Mathematics
0405: Mathematics
0796: Operations research
Identifier / keyword
Applied sciences; Pure sciences; Facility location; MFLP; MFRP; Mobile facilities; Mobile facility location problem; Mobile facility routing problem
Title
On the routing and location of mobile facilities
Author
Halper, Russell David
Number of pages
191
Publication year
2010
Degree date
2010
School code
0117
Source
DAI-B 71/07, Dissertation Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
ISBN
9781124072456
Advisor
Raghavan, Subramanian
Committee member
Golden, Bruce; Hunt, Brian; Miller-Hooks, Elise; Trivisa, Konstantina
University/institution
University of Maryland, College Park
Department
Applied Mathematics and Scientific Computation
University location
United States -- Maryland
Degree
Ph.D.
Source type
Dissertations & Theses
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
3409584
ProQuest document ID
734856916
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
http://search.proquest.com/docview/734856916
Access the complete full text

You can get the full text of this document if it is part of your institution's ProQuest subscription.

Try one of the following:

  • Connect to ProQuest through your library network and search for the document from there.
  • Request the document from your library.
  • Go to the ProQuest login page and enter a ProQuest or My Research username / password.