Results 1  10
of
32
Facility location models for distribution system design
, 2004
"... The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamenta ..."
Abstract

Cited by 56 (0 self)
 Add to MetaCart
The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamental assumptions, mathematical complexity and computational performance. This paper reviews some of the contributions to the current stateoftheart. In particular, continuous location models, network location models, mixedinteger programming models, and applications are summarized.
Distribution Network Design: New Problems and Related Models
 European Journal of Operational Research
, 2001
"... We study some complex distribution network design problems, which involve facility location, warehousing, transportation and inventory decisions. Several realistic scenarios are investigated. Two kinds of mathematical programming formulations are proposed for all the introduced problems, togethe ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
(Show Context)
We study some complex distribution network design problems, which involve facility location, warehousing, transportation and inventory decisions. Several realistic scenarios are investigated. Two kinds of mathematical programming formulations are proposed for all the introduced problems, together with a proof of their correctness. Some formulations extend models proposed by Perl and Daskin (1985) for some warehouse locationrouting problems; other formulations are based on ow variables and constraints. 1
Locationrouting: Issues, models and methods
"... This paper is a survey of locationrouting: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and look at a number of problem variants. Both exact and heuristic algorithms are investigated. Finally, some suggestions fo ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This paper is a survey of locationrouting: a relatively new branch of locational analysis that takes into account vehicle routing aspects. We propose a classification scheme and look at a number of problem variants. Both exact and heuristic algorithms are investigated. Finally, some suggestions for future research are presented.
Heuristic solutions to multidepot locationrouting problems
 Computers & Operations Research
, 2002
"... This paper presents a method for solving the multidepot locationrouting problem (MDLRP). Since several unrealistic assumptions, such as homogeneous #eet type and unlimited number of available vehicles, are typically made concerning this problem, a mathematical formulation is given in which these a ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
(Show Context)
This paper presents a method for solving the multidepot locationrouting problem (MDLRP). Since several unrealistic assumptions, such as homogeneous #eet type and unlimited number of available vehicles, are typically made concerning this problem, a mathematical formulation is given in which these assumptions are relaxed. Since the inherent complexity of the LRP problem makes it impossible to solve the problem on a larger scale, the original problem is divided into two subproblems, i.e., the locationallocation problem, and the general vehicle routing problem, respectively. Each subproblem is then solved in a sequential and iterative manner by the simulated annealing algorithm embedded in the general framework for the problemsolving procedure. Test problems from the literature and newly created problems are used to test the proposed method. The results indicate that this method performs well in terms of the solution quality and run time consumed. In addition, the setting of parameters throughout the solution procedure for obtaining quick and favorable solutions is also suggested. Scope and purpose In many logistic environments managers must make decisions such as location for distribution centers (DC), allocation of customers to each service area, and transportation plans connecting customers. The locationrouting problems (LRPs) are, hence, de&quot;ned to &quot;nd the optimal number and locations of the DCs,
A Home Health Care Routing and Scheduling Problem
, 1998
"... this paper is posed in the context of a home health care problem. Despite the fact that in this industry, health care is provided by many qualified individuals such as registered nurses, physical therapists and home health aides, for notational simplicity, we will refer to the employees as simply nu ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
this paper is posed in the context of a home health care problem. Despite the fact that in this industry, health care is provided by many qualified individuals such as registered nurses, physical therapists and home health aides, for notational simplicity, we will refer to the employees as simply nurses. The only differentiation that we make is between salaried workers (fulltime nurses) and nonsalaried workers (parttime nurses). Salaried workers are paid for a fulltime shift everyday, whether or not they are scheduled to work the entire time. They are paid overtime if they are required to work for longer than the standard shift length. Parttime nurses are paid by the hour. The differences in the nurses' qualifications are represented by a binary relationship with each patient; a nursepatient pair is thus, either a feasible match or an infeasible match. Accordingly, the nurse may be scheduled to visit the patient, or he or she may not. Additionally, a company in this industry would like to not only satisfy a customer's need for health care, but also keep the customer happy by providing dependable service (i.e. providing health care when the customer requests it). Thus, most home health care companies allow the customer to specify a time window during which he or she will be at home awaiting the requested care. In summary, the problem is to find an optimal schedule such that each nurse that is scheduled to work leaves from his or her home, visits a set of "feasible" patients within their time windows, takes a lunch break within the nurse's lunch time window, and returns home, all within the nurse's time window (which indicates the times during which the nurse is willing to work) and within the known limit on the length of a shift. The optimal schedule minimizes th...
Facility Location in SUpply Chain Design
, 2003
"... In this chapter we outline the importance of facility location decisions in supply chain design. We begin with a review of classical models including the traditional fixed charge facility location problem. We then summarize more recent research aimed at expanding the context of facility location ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
In this chapter we outline the importance of facility location decisions in supply chain design. We begin with a review of classical models including the traditional fixed charge facility location problem. We then summarize more recent research aimed at expanding the context of facility location decisions to incorporate additional features of a supply chain including LTL vehicle routing, inventory management, robustness, and reliability.
Dynamic and Stochastic Models with Freight Distribution Applications
, 1996
"... Thanks to my family; my father Robert and my mother Johanna, and my sisters Maryke and Annaleen, for their encouragement, correspondence and visits, and for having me in their thoughts so often. It is their love and support through the years that made this achievement possible. ii ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Thanks to my family; my father Robert and my mother Johanna, and my sisters Maryke and Annaleen, for their encouragement, correspondence and visits, and for having me in their thoughts so often. It is their love and support through the years that made this achievement possible. ii
Stochastic Vehicle Routing Problem for Largescale Emergencies
, 2001
"... In this paper, we are interested in routing vehicles to service largescale emergencies, such as natural disasters and terrorist attacks. We first analyze the characteristics of the routing problem for largescale emergencies. We then survey the stochastic Vehicle Routing Problems (VRPs) and some va ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper, we are interested in routing vehicles to service largescale emergencies, such as natural disasters and terrorist attacks. We first analyze the characteristics of the routing problem for largescale emergencies. We then survey the stochastic Vehicle Routing Problems (VRPs) and some variants of VRPs that are relevant to emergency response. We propose and discuss a mathematical formulation for this problem and a twostage solution approach for it. Lastly, in an illustrative example of an anthrax terrorist attack, we demonstrate the effectiveness of our formulation in developing robust routes. 1
An Exact Algorithm For Period And MultiDepot Vehicle Routing Problems
, 2003
"... This paper presents an exact method for two important generalizations of the classical Capacitated Vehicle Routing problem (CVRP): the Period Vehicle Routing Problem (PVRP) and the MultiDepot Vehicle Routing Problem (MDVRP). The VRP is defined on a graph G=(V, A), where V={0,1,...,n} is the vertex ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper presents an exact method for two important generalizations of the classical Capacitated Vehicle Routing problem (CVRP): the Period Vehicle Routing Problem (PVRP) and the MultiDepot Vehicle Routing Problem (MDVRP). The VRP is defined on a graph G=(V, A), where V={0,1,...,n} is the vertex set and A={(i,j): i,jUV, i j} is the arc set. The distinguished vertex 0 represents the depot where m identical vehicles of capacity Q are located. Each vertex iV\{0} corresponds to a customer and has a non negative demand q i . With each arc (i,j) A is associated a cost d ij . The CVRP consists of designing one route for each vehicle such that: (i) each route starts and ends at the depot; (ii) each customer is visited exactly once; (ii) the total demand of the customers visited by a route does not exceed Q and (iv) the total route cost is minimized. The PVRP consists of designing a set of routes for each day of a given planning period of p days. Each customer may require k (say) visits dur...