TITLE

A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree

AUTHOR(S)
Averbakh, Igor; Berman, Oded
PUB. DATE
August 1996
SOURCE
Transportation Science;Aug96, Vol. 30 Issue 3, p261
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The problem of locating p distinguishable facilities on a tree network with n nodes, subject to interfacility distance constraints, is considered. Each facility must be located within its own feasible region, that is selected in advance based on previous analysis. The main difference from the variants of the problem studied earlier is that more general feasible regions are allowed, A sequential location scheme for solving the problem is formulated, and sufficient conditions for the applicability of the scheme are presented. For the special case where the feasible regions are finite (sets of selected nodes of the tree), it is demonstrated that the sufficient conditions can be checked in O(pn) time; if they hold, the sequential location scheme can he implemented in O(np²) time (for the case of finite feasible regions).
ACCESSION #
4455420

 

Related Articles

  • Models and Algorithms for Single-Depot Vehicle Scheduling. Freling, Richard; Wagelmans, Albert P. M.; Paixão, José M. Pinto // Transportation Science;May2001, Vol. 35 Issue 2, p1 

    Vehicle scheduling is the process of assigning vehicles to a set of predetermined trips with fixed starting and ending times, while minimizing capital and operating costs. This paper considers modeling, algorithmic, and computational aspects of the polynomially solvable case in which there is a...

  • NEW APPLICATIONS OF FRACTIONAL COMPLEX TRANSFORMS TO MATHEMATICAL PHYSICS. AHMAD, Jamshad; MOHYUD-DIN, Syed Tauseef // Annals of the Faculty of Engineering Hunedoara - International J;Aug2015, Vol. 13 Issue 3, p249 

    This paper witnesses the coupling of an analytical series expansion method Reduced Differential Transform with fractional complex transforms. The proposed technique is applied on three mathematical models subject to the appropriate initial conditions which arise in mathematical physics. The...

  • A cluster-based scheduling model using SPT and SA for dynamic hybrid flow shop problems. Wang, Kai; Choi, Shiu; Qin, Hu; Huang, Yun // International Journal of Advanced Manufacturing Technology;Aug2013, Vol. 67 Issue 9-12, p2243 

    The hybrid flow shop (HFS) scheduling, typically found in a variety of real-world industries, is an NP-hard combinatorial optimisation problem. Consideration of uncertainties hugely aggravates its complexity. This paper considers makespan minimisation of dynamic HFS scheduling problems under...

  • IMPROVEMENT OF PREVENTIVE MAINTENANCE AT MILITARY VEHICLES USING CRITERIA EFFECTIVENESS OF TRANSPORT SERVICES. VIRCA, Ioan; GRIGORAŞ, Constantin // Revista Academiei Fortelor Terestre;2014, Vol. 19 Issue 2, p217 

    The preventive maintenance that applies to vehicles in their fleets can still cause some increase in their availability and reduce operating costs. Preventive maintenance works on motor vehicles is running after a certain mileage or time, when the time to go to the next maintenance was consumed...

  • Decision Tree Model for Count Data. Yap Bee Wah; Nasaruddin, Norashikin; Wong Shaw Voon; Lazim, Mohamad Alias // Proceedings of the World Congress on Engineering 2012 Volume I;2012, p330 

    The Poisson Regression and Negative Binomial Regression models are the conventional statistical models for count data. This paper presents using decision tree to model motorcycle accident occurrences and compared its classification performance with Poisson Regression and Negative Binomial...

  • Interactive Optimization of Bulk Sugar Deliveries . van Vliet, Andre; Boender, C. Guus E.; Rinnooy Kan, Alexander H. G. // Interfaces;May/Jun92, Vol. 22 Issue 3, p4 

    An interactive optimization system for planning bulk deliveries was implemented by Suiker Unie, a farming cooperative that processes about 60 percent of the Dutch sugar beet crop. The bulk delivery problem differs in several aspects from the standard multi-depot vehicle-routing problem: trucks...

  • Scheduling Direct and Indirect Trains and Containers in an Intermodal Setting. Newman, Alexandra M.; Yano, Candace Arai // Transportation Science;Aug2000, Vol. 34 Issue 3, p256 

    The focus of our research is on rail transportation of intermodal containers. We address the problem of determining day-of-week schedules for both direct and indirect (via a hub) trains and allocating containers to these trains for the rail (linehaul) portion of the intermodal trip. The goal is...

  • Equilibrium Queueing Patterns at a Two-Tandem Bottleneck during the Morning Peak. Kuwahara, Masao // Transportation Science;Aug90, Vol. 24 Issue 3, p217 

    Several researchers have analyzed queueing patterns at bottleneck sites on freeways during the morning peak. However, all previous studies have assumed that each commuter passes only one bottleneck during his commuting trip. Here, we consider the possibility that some commuters pass two...

  • Scheduling Dial-a-Ride Transportation Systems. Stein, David M. // Transportation Science;Aug78, Vol. 12 Issue 3, p232 

    An analytic investigation into the fundamental aspects of scheduling "Dial-a-Ride" transportation systems is conducted. Based upon simple mathematical models that focus on the combinatorial nature of the problem, a class of algorithms is derived for which performance can be measured in a precise...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics