picksolved
solved 时间:2021-01-17 阅读:()
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org50A0-1MODELFORFIREANDEMERGENCYSERVICEFACILITYLOCATIONSELECTION:ACASESTUDYINNIGERIAAROGUNDADEO.
T.
,AKINWALEA.
T.
;ADEKOYAA.
F.
ANDAWEOLUDAREG.
DepartmentOfComputerScience,UniversityOfAgriculture,P.
M.
B2240,Abeokuta,OgunState,Nigeria.
E-mail:arogundade@acm.
org,atakinwale@yahoo.
com,lanlenge@yahoo.
comandaweolu@yahoo.
comABSTRACT:Facilitylocationselectionproblemisavariantofsetcoveringproblem.
Setcoveringproblemisaclassicalproblemincomputerscienceandcomplexitytheory.
Inthispapertwodifferenttechniquesareappliedtofacilitylocationproblems.
First,amathematicalmodeloffacilitylocationisintroducedandsolvedbyusingoptimizationsolver,TORA.
Secondly,thebalasadditivealgorithmofbranchandboundtechniquesisusedtosolvethefacilitylocationproblem.
TestsweremadeusingreallifedatafromacityinNigeria.
Wethenobservedthatbothalgorithmsindicatethesamenumberoffirestationsindifferentlocations.
Alsotheresultsobtainedbyapplyingandimplementingbalasadditiveweremoreexplanatorybyspecifyingthenamesofthelocationswherethefacilitiesaretobelocatedandthenamesofthelocationstobeservedbyeachofthefacilities.
Keywords:Setcoveringproblem,firestation,emergencyservice,branchandbound,integerlinearprogramming.
1INTRODUCTIONSetcoveringproblemisaclassicalproblemincomputerscienceandcomplexitytheory,andisoneofthemostimportantdiscreteoptimizationproblembecauseitservesasamodelforrealworldproblems.
Realworldproblemsthatcanbemodeledassetcoveringproblemincludeairlinecrewscheduling,nurseschedulingproblems,resourceallocation,assemblylinebalancing,vehiclerouting,facilitylocationproblemwhichisthemainfocusofthiswork.
Etc.
Setcoveringproblemisaproblemofcoveringtherowofanm-row/n-columnzero-onematrixwithasubsetofcolumnsatminimalcost[1].
ThesetcoverproblemisaclassicNP-hardproblemstudiedextensivelyinliterature,andthebestapproximationfactorachievableforitinpolynomialtimeis(logn)[2,3,4].
Arichliteraturehasbeendevelopedandseveralmodelshavebeenformulatedandappliedtothefacilitylocationproblemsoverthelastfewyears.
Thecomplexityoftheseproblemsisduetothemultitudesofquantitativeandqualitativefactorsinfluencinglocationchoices.
However,investigatorshavefocusedonbothalgorithmsandformulationindiversesettingintheprivatesector(e.
g.
industrialplants,retailfacilities,telecommunicationmastetc)andthepublicsectors(e.
g.
schools,healthcenters,ambulances,clinicsetc).
Inthiswork,ourinterestisononeofthepublicsectorfacilitylocationproblem,thefireandemergencyservicelocationproblem.
Infact,fireandemergencyserviceiscrucialinsavinglivesandvaluablepropertiesandthereforemustprovidehighlevelofqualityservicestoensurepublicsafety.
Butprovidingthesefacilitieseffectivelyisacomplexissuethatespeciallydependsonsomefactorsandmostespeciallyonthebestgeographicallocationofthefirefightingandemergenciesservicefacilities.
TheaimofthispaperthereforeistouseaSetCoveringmodeltoselecttheminimumfirestationsthatcouldserveallareasinabigcityinsuchawaythateachwardwillhaveequalbenefitsintermsofservicesfromthefirestationsandalsothefacilitywillbestrategicallyplaced.
TheprocessinvolvesgatheringdataaboutallthewardsinthecityusingtheGPS(GlobalPointSystem)soastogettheirdistancesfromeachotherusingGISsoftware(GeographicalInformationService).
WethendevelopedadecisionsupportsytemthatdeterminetheminimumnumberoffirestationsneededtoserveallthewardssuchthattheJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org51distancebetweeneachwardandatleastonestationislessorequal10kilometersbysolvingthemathematicalmodelofthesetcoveringproblemusingtheBalasAdditivealgorithmaspecialcaseofbranchandboundthathandlesbinarylinearprogrammingproblem.
TheresultobtainedwascomparedtotheresultobtainedfromTORAsolver.
2LITERATUREREVIEWTheClassicalLocationSetCoveringProbleminvolvesfindingthesmallestnumberoffacilitiesandtheirlocationsothatdemandiscoveredbyatleastonefacility.
Itwasfirstintroducedby[12].
Theproblemrepresentseveraldifferentapplicationsettingincludingthelocationofemergencyserviceandtheapplicationsettingincludingthelocationofemergencyservicesandtheselectingofconservativesites.
Theproblemiscalledcoveringprobleminthatitrequiresthateachdemandbeservedor"covered"withinsomemaximumtimeanddistancestandards.
Ademandisdefinedascoveredifoneormorefacilitiesarelocatedwithinthemaximumdistanceortimestandardsofthatdemand.
ThesecondtypeofcoveringproblemiscalledtheMaximalCoveringLocationProblem[13].
Sincethedevelopmentofthesetwojuxtaposedproblemswereformed,therehavebeennumerousapplicationsandextensions.
SetCoveringProblemisoneofthemostprominentNP-completeproblem.
(Anexhaustivealgorithmmustsearchthroughall2msubsetsofStofindthosewhicharecoveringsubsetsandthenpicktheminimalfromamongthese[4]andcanformallybedefinedasfollow:Uistheuniversalset,SisacollectionofsubsetsofU,andc:S->Nisacostfunction.
ThegoalistofindacollectionS1,S2.
.
.
,SKofelementsofSsuchthatS1US2U.
.
.
USk=Uwithminimaltotalcost.
[16].
Significantresearchhasbeendirectedtowardstheproblemoflocatingandcoveringproblemsandseveralmethodshavebeenmadetoprovidesolutionsspecificallytothefacilitieslocationproblemandthesemethodsgenerallyinvolvetheuseofqueuingmodels[5],simulationandmathematicalprogramming,alsoacombinationofsimulationmodelandheuristicsearchroutines[6].
Alsoanextensivenumberofpapershavebeendedicatedtothesetcoveringproblem(SCP)andmanyexactalgorithms[7,10]whichcansolveinstanceswithuptofewhundredrowsandcolumns.
Acomparisonofsomeexactalgorithmscanbefoundin[9].
ApproximationalgorithmsplaysanimportantroleinsolvingSCP,giventhelimitationofexactmethodsandthelargelistofapplicationsusinglargesizeSCP[12].
Virtuallyeveryheuristicapproachforsolvinggeneralintegerproblemhasbeenappliedtosetcoveringproblems.
Thesetcoveringformulationnaturallylendsthemselvestogreedystart(i.
e.
anapproachthatateveryiterationmyopicallychoosesthenextbestsolutionwithoutregardsforitsimplicationonfuturemoves).
Interchangeapproacheshavealsobeenapplied;hereaswapofoneormorecolumnistakenwheneversuchaswapimprovestheobjectivefunctionvalue.
Newerheuristicapproachessuchasgeneticalgorithm,probabilisticsearch[8],simulatedannealing[11]andneuralnetworkhavealsobeentried.
Unfortunately,therehasnotbeenacomparativetestingacrosssuchmethodstodetermineunderwhatcircumstancesaspecificmethodmightperformbest.
Inaddition,onecanembedheuristicwithinanexactalgorithmsothatonecaniterativelytightentheupperboundandatthesametimeoneisattemptingtogetatightapproximationtothelowerboundforthisproblem.
Problemsarisinginpracticedonothoweverhaveperfectoridealmatrices.
Nevertheless,ithasbeenobservedincomputationalpracticethataslongastheproblemtobesolvedarerelativelyofmediumsize,linearprogrammingwithbranchandboundwillprovideintegersolutionquicklyandoptimally.
Howeverasthesubprogramsizeincreases,thenonintegralityofthelinearprogrammingsolutionincreasesdramaticallyanddoesthelengthandsizebranchingtree.
Itisforthislargeinstanceofproblemthatapproximationtechniques,reformulationandexactprocedureshavebeendevelopedthatexploittheunderlyingstructureoftheproblem.
IntegerLinearProgramming(ILPs)arelinearprogramsinwhichsomeorallofthevariablesarerestrictedtointeger(ordiscrete)values.
ILPhasimportantpracticalapplication.
Unfortunately,despitedecadesofextensiveresearch,computationalexperienceswithILPJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org52havebeenlessthansatisfactory.
TodatetheredoesnotexistanILPcomputercodethatcansolveintegerlinearproblemsconsistently[15].
2.
1ProblemStatementConsiderafirestationlocationandallocationproblemhavingthefollowingfeatures:Afirestationlocatedinawardhastoserveasetofwards.
Eachwardtobeservedmustbelocatedatfixeddistancetothelocationofthefirestation.
Theminimumnumberoffirestationsthatcanserveallthewardsmustbedetermined.
Themathematicalmodelofthisproblemisformulatedasfollow.
MinZ=∑Cjxjj={1,2,…n}Subjectedto:∑aijxj≥1i={1,2,…m}xj={0,1}whereCjisthecostofinstallation,xirepresentsacoveringi.
xjwhichcantakethevalue0or1dependingonifwardiisincoveringxj.
3MethodologyThispaperaimstoobtainanoptimalsolutiontofireandemergencyfacilitieslocationproblem.
WeusetheGPS(GlobalPointSystem)equipmenttogetthecoordinatesofallthewardsinthecityunderconsideration.
Fromthescreenoftheequipment,wegottheNorth-axisandtheEast-axisofeveryparticularplacewevisited(37wards).
Afterthecollectionofthecoordinates,weinstalledtheGIS(GeographicalInformationSystem)softwareforanalysis.
WethensupplythecoordinatesofeachwardintotheGISwhichthenlocatethepositionofthewardsonthemapofOgunstate(seefigure1)andthereafterobtainedthedistancereadingsforeachwardtotheother.
Figure1.
WardslocationonthemapJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org53Theresultobtainedfromthedistancereadingisa37by37matrixwhichwethentransformedintocoveringsaccordingtoaspecifieddistance(precisely10kmfromeachwards).
Forexample,thefirstcoverwhichis{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}indicatethosewardthatcanbecoveredwithintherangeof10kmfromward1.
Thepartoftheresultofthisprocessisshowninfigure2.
Accordingtoourfirstdefinitionofsetcoveringproblem,theuniversalsetUis{1,2…37}andF={C1,C2,…………….
C37},nowouraimistofindtheminimumSasubsetofFsuchthatitsunionwillgiveusU,andatthisstagethewardsareallcoveredwithequaldistancesandtheCipickedarethewardswherethefirestationshouldbelocated.
Thesedatawerethenslottedintothebalasadditiveandtorasolvertosolvethefacilitylocationproblem.
Theresultsfromthetwoalgorithmswerethencomparedtodeterminetheoptimalcase.
Figure2.
Wardscovering3.
1ModelsUsedToSolveFireAndEmergencyFacilityLocationProblem3.
1.
1.
BalasAdditiveAlgorithmTheadditivealgorithmwasoneoftheapproachesknownasbranchandboundandisusedtosolvelinearprogramsinn0-1variablesbysystematicallyenumeratingasubsetof2npossiblebinarynvectors,whileusingthelogicalimplicationofthe0-1propertytoensurethatthewholesetisimplicitlyexamined.
Thetechniqueemployedinthisalgorithmisbasedonsystematicallyassigningthevalue0and1tocertainsubsetofvariablesandexploringtheimplicationsoftheseassignmentsbyasequenceoflogicaltests.
Thesimplicityoftheprocedureanditseffectivenesswhendataarenottoolargemakesitabetterchoiceforthisresearchwork.
BalasAdditivealgorithmrequiredthattheproblembeputinstandardform:1.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromObantoko.
2.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromIkija3.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromAgoOko16{16,24}fromAlagbagba18{18,21,23}fromOsiele37{1,2,3,4,5,6,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromPansekeJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org54TheobjectivefunctionisaformofminimizationThemconstraintsareallinequalitiesoftheform(≤)AllthevariablesxjarebinaryvariablesAllobjectivefunctioncoefficientsarenonnegativeAlgorithm:BalasAdditiveAlgorithm1Standardizetheproblemtotheform:MinZ=∑j∈NCjxjs.
t∑j∈Naijxj≤biforalli∈M.
whereM={1,2,…m}andN={1,2,…n}xj={0,1},forallj∈N2SetaninitialupperboundtoZ=+∞,seti=0,andJ={}.
3SelectthenextpartialsolutionJ,solvetheLPiofJandattempttofathomusingoneofthethreeconditionslistedbelow.
a.
Allcompletionviolatesoneormoreconstraints.
i.
ecomputei.
A={j:j∈N-J,aij≥0foralli∈MsuchthatSi≤0}ii.
N1=N–J–AIfNI={}thenfathomthepartialsolutionJb.
Allcompletionareinferiortotheincumbentz'i.
ecomputei.
B={j:j∈N1,Z+Cj≥Z'}ii.
N2=N1–BIfN2={}thenfathompartialsolutionJc.
IfconstraintiisviolatedbythezerocompletionofthepartialsolutionsothatSi{}thenfathomthepartialsolutionJIfallthefathomtestfail,Gotostep64.
Ifbettersolutionisfound,thenupdateZ5IfallelementsofJisfathomedi.
eunderlined,thenZisoptimalGotostep7ElsesetJJ,{-j}andrepeatfromstep36Performbranchingby:i)Selectfreevariableforforwardstepii)SetJJ,{+j}Seti=i+1andrepeatstep37Terminate3.
1.
2.
TORAOneofthepowerfulfeaturesofTORAisitsgraphicaluserinterface(GUI)whichenablesuserstoexpresstheirproblemsinanaturalwaythatisverysimilartostandardmathematicalnotation.
ThisfeatureofGUIallowsuserstochoosethenextactionbeingmenudriven.
Thisoffersflexibilitytouserstoincreaseordecreasethedatasizeortoremoveaparticularvariablecompletely.
TORAoptimizationsolverhasthefollowingattributes:a.
Sets,whichcompriseofobjectsinprogrammingmodelb.
Objectivefunctionoftheproblemc.
ConstraintsofProblemd.
inputdataJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org554IMPLEMENTATIONANDRESULT4.
1FormatofinputdataInthispaper,theinputis38x380-1matrixwherecolumn2-38representseachcoveringandrow2-38representseachward.
Therefore,foreachcolumnandrow,theelementis1ifthewardiscoveredand0ifnotcovered.
E.
gthenameofthematrixisa,ifa[2][3]=1,itimpliesthatward3iscoveredbycovering2,otherwiseitisnotcoveredandthevaluewillbe0.
Thewholeinputfileformatforthisworkisshowninfigure4.
Theformatoftheoutputisinformofasolutionvectorcontainingonlyzerosandonesi.
e.
1ifacoveringisselectedand0ifnotselected.
Eachcoveringhasspecificnameofwardscoveringotherwardsthatarewithinthespecifieddistance.
(Thenameofeachwardandthenumberattachedtothemisshowninfigure3.
Figure3NamesofwardsandtheirnumberofidentificationTheinputmatrixshowninfigure4aandfigure4bwassavedastextfileandthebalasadditivealgorithmwasimplementedusingJavaprogramminglanguage.
Figure4aInputFileFormat1Obantoko,2Ikija,3Agooko,4ElegaHousing,5Iberekodo,6Agoika,7Ayetoro,8Okeago,9Totoro,10Itaosin,11Olorunda,12ImalaOrile,13IbaraOrile,14Ilewo/isaga,15Itaota,16Alagbagba,17Alabata,18Osiele,19Olodo,20Ilugun,21Agoodo,22Opeji,23Odeda,24Itesi,25Lafenwa,26Saje,27Itoko,28Ake,29Lantoro,30Ijemo,31Iporosodeke,32Irunbe,33Ijaye,34Okeitoku,35IjehunTitun,36Sabo,37Panseke.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org56Figure4bInputFileFormatOncetheinputfilehasbeenselected,andthentheprogramcanberuntogeneratetheoutputrequired.
Theresultaftertheclickofthe"run"buttonisshowninfigure5below.
Figure5SetCoveringoutput.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org57Thebalasadditiveresultaboveshowedthatcoveringisfoundandalsodisplayedthesolutionvector.
Itindicatedthatsixfirestationsareneededtoserveallthewardsandthelocationsofthosestationsareclearlystated.
ThesameresultwasobtainedfromTORAsoftwareintermsofoptimality,butthelocationsaredifferentandnotclearlystatedthoughitcanbetracedout.
Figure6ResultfromTORAsolverFigure6showstheresultoftheTORAsolver,theresultsissuchthatsixfirestationsarealsoneededtoserveallthewardseffectivelybutthelocationsofthefireservicestationarequitedifferentfromthatofBALASalgorithmthatwasimplemented.
Thelocationsindicatedbythesolverarelocations11,14,17,19,21,24whichcorrespondstothenamesofthefollowingwards(Olorunda,IlewoIsaga,alabata,Olodo,Ago-OdoandItesi)asshowninfigure3.
Torasolverdoesnotlistthenamesornumbersofthevillagesinitscovering.
5DISCUSSIONThenecessityofthedevelopmentoffacilitieslocationsoftwareforenhancingthedecisionmakingprocessandeventuallyproductivitycannotbeover-emphasized.
Theresultsobtainedinthisworkshowedthatsixfirestationsareneededtoserveeverywardsuchthatthemaximumdistancethatafirestationservicecangois10kilometers.
ItalsoshowedthatthelocationofthestationshouldbeObantoko,Olorunda,Ibaraorile,Olodo,OpejiandOdeda.
ThefirestationsatObantokowillrenderservicestotwentyfivewardswhichare:Obantoko,Ikija,Ago-oko,Elega,iberekodo,Ago-Ika,Ayetoro,Oke-ago,totoro,Ita-osin,Ita-ota,Ago-odo,lafenwa,Saje,Itoko,Ake,Lantoro,Ijemo,Iporo-sodeke,irunbe,Ijaye,Oke-itoku,Ijeun-titun,SaboandPanseke.
Olorundaservicestationwillservetwowardswhichare:OlorundaandImala-Orile.
Ibara-OrileservicestationwillserveIbara-orileandIlewo-Isagarespectively.
Olodoservicestationwillservethreewards.
Theyare:alagbagba,OlodoandIlugun.
Opejiwillservefourwardswhichare:alabata,OsieleandOpeji.
FinallyodedastationwillserveOdedaandItesi.
ThoughtheresultfromTORAsolveralsoindicatedthatsixfirestationsareneeded,itdidnotspecifytheactuallocationswherethestationsshouldbelocated.
ThisshortcominginTORAmakesouroutputandimplementationabetterone.
Theseresultsarepresentedinthetablebelowformoreclarity.
Itshowsthelocationswherethefacilitiesaretobeinstalledandalsothevillagestobecoveredbyeachofthefacility(coverings)onlyforbalasadditivealgorithm.
Theoutputfrombalasadditivealgorithmdoesnotshowfairdistribution.
InthecaseofthefacilityinlocationObantokowhichistoserve25locationswhileothersserveminimumoftwolocationsandmaximumofthree.
ThefacilityinObantokowillbeoverused.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org58Table1:OUTPUTOFBALASADDITIVEALGORITHMLocationidentificationnumberLocationnameCoverings1Obantoko1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,3711Olorunda11,1213Ibaraorile13,1419Olodo16,19,2022Opeji17,18,2223Odeda23,24TABLE2:OUTPUTOFTORASOLVERLocationIdentificationNumberLocationNameCoverings11OlorundaNotindicated14Ilewo-IsagaNotindicated17AlabataNotindicated19OlodoNotindicated21Ago-odoNotindicated24ItesiNotindicated6CONCLUSIONSANDRECOMMENDATIONSThisresultthereforeshouldraiseawarenessandcontributetotheaimofourgovernmenttoadoptthistoolwhichwilldefinitelyimprovethefunctionalityoffirestationsinNigeriabysavingalotofcitizen'slivesandproperties.
Itshouldalsobenotedthattheuseofthissystemisnotlimitedonlytofirestationsallocationalone,butalsotootherpublicfacilitieslikeschools,policestationsoastoincreaseresponsetimeandthereforereducecrime.
Itcanalsobeusedbyprivateestablishments.
REFERENCES[1]J.
EBeasleyandP.
C.
Chu,"Ageneticalgorithmforthesetcoveringproblem",EuropeanJournalofOperationalResearch,vol.
94,1996,pp.
392-404.
[2]V.
Chvatal.
Agreedyheuristicforthesetcoveringproblem.
MathematicsofOperationResearch,4(3):233-235,1979.
[3]U.
Fiege.
Athresholdforlnnforapproximatingsetcover.
JournaloftheACM,45(4):634-652,July1998.
[4]D.
S.
Johnson.
Approximationalgorithmsforcombinatorialproblems.
J.
Compute.
SystemScience9:256-278,1974.
[5]LarsonRichardC.
,"AHypercubeQueuingModelforfacilitylocationandredistrictinginurbanemergencyservices",ComputersandOperationsResearch1(1974)67-95.
[6]SavasES,"Simulationandcost-effectivenessanalysisofNewYork'semergencyambulanceservice",ManagementScience14(1969)608-627.
[7]M.
L.
FisherandP.
Kedia.
OptimalSolutionofsetcoveringproblemsusingdualheuristics.
ManagementScience,36:674-688,1990.
[8]FeoA.
andG.
C.
MauricioandA.
Resende,(2002)"AProbabilisticHeuristicforaComputationallyDifficultSetCoveringProblem",OperationsResearchLetters,8,67-71.
[9]A.
Caparara,M.
Fischetti,andP.
Toth.
AlgorithmsforsetcoverinproblemstechnicalreportOR-98-3,DEIS,UniversityofBologna,Italy1998.
[10]N.
ChristofidesandJ.
PPaixao.
Algorithmsforlargescalesetcoveringproblems.
AnnalsofOperationResearch,43:261-277,1993.
[11]M.
JBrusco,L.
W.
Jacobs,andG.
MThompson.
Amorphingproceduretosupplementasimulatedannealingheuristicsforcostandcoverage-correlatedsetcoveringproblems.
AnnalsofOperationResearch,86:611-627,1999.
[12]ToregasC.
,SwainR.
,RevelleC.
,andBergmanL.
,(1988)"ThelocationofJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org59emergencyservicefacilities",Operationresearch19,pg1363-1373.
[13]ChurchRichardL.
,GerardRossa.
,(2003)"Themultilevellocationsetcoveringmodel"GeographicalAnalysisPublication,pg76-79.
[14]GareyM.
R.
andJohnsonD.
S.
,(2005)"Computerandinteractability:aguidetothetheoryofNP-completeness",pg34-38.
[15]Handya.
Taha.
,(2005)'OperationResearch:Anintroduction",Pearsoneducation(Singapore)Pte.
Ltd.
,pg391-397.
[16]Danielgulotta,(2006)"ApplicationoflinearProgrammingtosetcoveringandrelatedproblems"OnlinejournalofOperationResearch,pg1-2.
Allrightsreserved.
www.
jatit.
org50A0-1MODELFORFIREANDEMERGENCYSERVICEFACILITYLOCATIONSELECTION:ACASESTUDYINNIGERIAAROGUNDADEO.
T.
,AKINWALEA.
T.
;ADEKOYAA.
F.
ANDAWEOLUDAREG.
DepartmentOfComputerScience,UniversityOfAgriculture,P.
M.
B2240,Abeokuta,OgunState,Nigeria.
E-mail:arogundade@acm.
org,atakinwale@yahoo.
com,lanlenge@yahoo.
comandaweolu@yahoo.
comABSTRACT:Facilitylocationselectionproblemisavariantofsetcoveringproblem.
Setcoveringproblemisaclassicalproblemincomputerscienceandcomplexitytheory.
Inthispapertwodifferenttechniquesareappliedtofacilitylocationproblems.
First,amathematicalmodeloffacilitylocationisintroducedandsolvedbyusingoptimizationsolver,TORA.
Secondly,thebalasadditivealgorithmofbranchandboundtechniquesisusedtosolvethefacilitylocationproblem.
TestsweremadeusingreallifedatafromacityinNigeria.
Wethenobservedthatbothalgorithmsindicatethesamenumberoffirestationsindifferentlocations.
Alsotheresultsobtainedbyapplyingandimplementingbalasadditiveweremoreexplanatorybyspecifyingthenamesofthelocationswherethefacilitiesaretobelocatedandthenamesofthelocationstobeservedbyeachofthefacilities.
Keywords:Setcoveringproblem,firestation,emergencyservice,branchandbound,integerlinearprogramming.
1INTRODUCTIONSetcoveringproblemisaclassicalproblemincomputerscienceandcomplexitytheory,andisoneofthemostimportantdiscreteoptimizationproblembecauseitservesasamodelforrealworldproblems.
Realworldproblemsthatcanbemodeledassetcoveringproblemincludeairlinecrewscheduling,nurseschedulingproblems,resourceallocation,assemblylinebalancing,vehiclerouting,facilitylocationproblemwhichisthemainfocusofthiswork.
Etc.
Setcoveringproblemisaproblemofcoveringtherowofanm-row/n-columnzero-onematrixwithasubsetofcolumnsatminimalcost[1].
ThesetcoverproblemisaclassicNP-hardproblemstudiedextensivelyinliterature,andthebestapproximationfactorachievableforitinpolynomialtimeis(logn)[2,3,4].
Arichliteraturehasbeendevelopedandseveralmodelshavebeenformulatedandappliedtothefacilitylocationproblemsoverthelastfewyears.
Thecomplexityoftheseproblemsisduetothemultitudesofquantitativeandqualitativefactorsinfluencinglocationchoices.
However,investigatorshavefocusedonbothalgorithmsandformulationindiversesettingintheprivatesector(e.
g.
industrialplants,retailfacilities,telecommunicationmastetc)andthepublicsectors(e.
g.
schools,healthcenters,ambulances,clinicsetc).
Inthiswork,ourinterestisononeofthepublicsectorfacilitylocationproblem,thefireandemergencyservicelocationproblem.
Infact,fireandemergencyserviceiscrucialinsavinglivesandvaluablepropertiesandthereforemustprovidehighlevelofqualityservicestoensurepublicsafety.
Butprovidingthesefacilitieseffectivelyisacomplexissuethatespeciallydependsonsomefactorsandmostespeciallyonthebestgeographicallocationofthefirefightingandemergenciesservicefacilities.
TheaimofthispaperthereforeistouseaSetCoveringmodeltoselecttheminimumfirestationsthatcouldserveallareasinabigcityinsuchawaythateachwardwillhaveequalbenefitsintermsofservicesfromthefirestationsandalsothefacilitywillbestrategicallyplaced.
TheprocessinvolvesgatheringdataaboutallthewardsinthecityusingtheGPS(GlobalPointSystem)soastogettheirdistancesfromeachotherusingGISsoftware(GeographicalInformationService).
WethendevelopedadecisionsupportsytemthatdeterminetheminimumnumberoffirestationsneededtoserveallthewardssuchthattheJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org51distancebetweeneachwardandatleastonestationislessorequal10kilometersbysolvingthemathematicalmodelofthesetcoveringproblemusingtheBalasAdditivealgorithmaspecialcaseofbranchandboundthathandlesbinarylinearprogrammingproblem.
TheresultobtainedwascomparedtotheresultobtainedfromTORAsolver.
2LITERATUREREVIEWTheClassicalLocationSetCoveringProbleminvolvesfindingthesmallestnumberoffacilitiesandtheirlocationsothatdemandiscoveredbyatleastonefacility.
Itwasfirstintroducedby[12].
Theproblemrepresentseveraldifferentapplicationsettingincludingthelocationofemergencyserviceandtheapplicationsettingincludingthelocationofemergencyservicesandtheselectingofconservativesites.
Theproblemiscalledcoveringprobleminthatitrequiresthateachdemandbeservedor"covered"withinsomemaximumtimeanddistancestandards.
Ademandisdefinedascoveredifoneormorefacilitiesarelocatedwithinthemaximumdistanceortimestandardsofthatdemand.
ThesecondtypeofcoveringproblemiscalledtheMaximalCoveringLocationProblem[13].
Sincethedevelopmentofthesetwojuxtaposedproblemswereformed,therehavebeennumerousapplicationsandextensions.
SetCoveringProblemisoneofthemostprominentNP-completeproblem.
(Anexhaustivealgorithmmustsearchthroughall2msubsetsofStofindthosewhicharecoveringsubsetsandthenpicktheminimalfromamongthese[4]andcanformallybedefinedasfollow:Uistheuniversalset,SisacollectionofsubsetsofU,andc:S->Nisacostfunction.
ThegoalistofindacollectionS1,S2.
.
.
,SKofelementsofSsuchthatS1US2U.
.
.
USk=Uwithminimaltotalcost.
[16].
Significantresearchhasbeendirectedtowardstheproblemoflocatingandcoveringproblemsandseveralmethodshavebeenmadetoprovidesolutionsspecificallytothefacilitieslocationproblemandthesemethodsgenerallyinvolvetheuseofqueuingmodels[5],simulationandmathematicalprogramming,alsoacombinationofsimulationmodelandheuristicsearchroutines[6].
Alsoanextensivenumberofpapershavebeendedicatedtothesetcoveringproblem(SCP)andmanyexactalgorithms[7,10]whichcansolveinstanceswithuptofewhundredrowsandcolumns.
Acomparisonofsomeexactalgorithmscanbefoundin[9].
ApproximationalgorithmsplaysanimportantroleinsolvingSCP,giventhelimitationofexactmethodsandthelargelistofapplicationsusinglargesizeSCP[12].
Virtuallyeveryheuristicapproachforsolvinggeneralintegerproblemhasbeenappliedtosetcoveringproblems.
Thesetcoveringformulationnaturallylendsthemselvestogreedystart(i.
e.
anapproachthatateveryiterationmyopicallychoosesthenextbestsolutionwithoutregardsforitsimplicationonfuturemoves).
Interchangeapproacheshavealsobeenapplied;hereaswapofoneormorecolumnistakenwheneversuchaswapimprovestheobjectivefunctionvalue.
Newerheuristicapproachessuchasgeneticalgorithm,probabilisticsearch[8],simulatedannealing[11]andneuralnetworkhavealsobeentried.
Unfortunately,therehasnotbeenacomparativetestingacrosssuchmethodstodetermineunderwhatcircumstancesaspecificmethodmightperformbest.
Inaddition,onecanembedheuristicwithinanexactalgorithmsothatonecaniterativelytightentheupperboundandatthesametimeoneisattemptingtogetatightapproximationtothelowerboundforthisproblem.
Problemsarisinginpracticedonothoweverhaveperfectoridealmatrices.
Nevertheless,ithasbeenobservedincomputationalpracticethataslongastheproblemtobesolvedarerelativelyofmediumsize,linearprogrammingwithbranchandboundwillprovideintegersolutionquicklyandoptimally.
Howeverasthesubprogramsizeincreases,thenonintegralityofthelinearprogrammingsolutionincreasesdramaticallyanddoesthelengthandsizebranchingtree.
Itisforthislargeinstanceofproblemthatapproximationtechniques,reformulationandexactprocedureshavebeendevelopedthatexploittheunderlyingstructureoftheproblem.
IntegerLinearProgramming(ILPs)arelinearprogramsinwhichsomeorallofthevariablesarerestrictedtointeger(ordiscrete)values.
ILPhasimportantpracticalapplication.
Unfortunately,despitedecadesofextensiveresearch,computationalexperienceswithILPJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org52havebeenlessthansatisfactory.
TodatetheredoesnotexistanILPcomputercodethatcansolveintegerlinearproblemsconsistently[15].
2.
1ProblemStatementConsiderafirestationlocationandallocationproblemhavingthefollowingfeatures:Afirestationlocatedinawardhastoserveasetofwards.
Eachwardtobeservedmustbelocatedatfixeddistancetothelocationofthefirestation.
Theminimumnumberoffirestationsthatcanserveallthewardsmustbedetermined.
Themathematicalmodelofthisproblemisformulatedasfollow.
MinZ=∑Cjxjj={1,2,…n}Subjectedto:∑aijxj≥1i={1,2,…m}xj={0,1}whereCjisthecostofinstallation,xirepresentsacoveringi.
xjwhichcantakethevalue0or1dependingonifwardiisincoveringxj.
3MethodologyThispaperaimstoobtainanoptimalsolutiontofireandemergencyfacilitieslocationproblem.
WeusetheGPS(GlobalPointSystem)equipmenttogetthecoordinatesofallthewardsinthecityunderconsideration.
Fromthescreenoftheequipment,wegottheNorth-axisandtheEast-axisofeveryparticularplacewevisited(37wards).
Afterthecollectionofthecoordinates,weinstalledtheGIS(GeographicalInformationSystem)softwareforanalysis.
WethensupplythecoordinatesofeachwardintotheGISwhichthenlocatethepositionofthewardsonthemapofOgunstate(seefigure1)andthereafterobtainedthedistancereadingsforeachwardtotheother.
Figure1.
WardslocationonthemapJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org53Theresultobtainedfromthedistancereadingisa37by37matrixwhichwethentransformedintocoveringsaccordingtoaspecifieddistance(precisely10kmfromeachwards).
Forexample,thefirstcoverwhichis{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}indicatethosewardthatcanbecoveredwithintherangeof10kmfromward1.
Thepartoftheresultofthisprocessisshowninfigure2.
Accordingtoourfirstdefinitionofsetcoveringproblem,theuniversalsetUis{1,2…37}andF={C1,C2,…………….
C37},nowouraimistofindtheminimumSasubsetofFsuchthatitsunionwillgiveusU,andatthisstagethewardsareallcoveredwithequaldistancesandtheCipickedarethewardswherethefirestationshouldbelocated.
Thesedatawerethenslottedintothebalasadditiveandtorasolvertosolvethefacilitylocationproblem.
Theresultsfromthetwoalgorithmswerethencomparedtodeterminetheoptimalcase.
Figure2.
Wardscovering3.
1ModelsUsedToSolveFireAndEmergencyFacilityLocationProblem3.
1.
1.
BalasAdditiveAlgorithmTheadditivealgorithmwasoneoftheapproachesknownasbranchandboundandisusedtosolvelinearprogramsinn0-1variablesbysystematicallyenumeratingasubsetof2npossiblebinarynvectors,whileusingthelogicalimplicationofthe0-1propertytoensurethatthewholesetisimplicitlyexamined.
Thetechniqueemployedinthisalgorithmisbasedonsystematicallyassigningthevalue0and1tocertainsubsetofvariablesandexploringtheimplicationsoftheseassignmentsbyasequenceoflogicaltests.
Thesimplicityoftheprocedureanditseffectivenesswhendataarenottoolargemakesitabetterchoiceforthisresearchwork.
BalasAdditivealgorithmrequiredthattheproblembeputinstandardform:1.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromObantoko.
2.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromIkija3.
{1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromAgoOko16{16,24}fromAlagbagba18{18,21,23}fromOsiele37{1,2,3,4,5,6,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,37}fromPansekeJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org54TheobjectivefunctionisaformofminimizationThemconstraintsareallinequalitiesoftheform(≤)AllthevariablesxjarebinaryvariablesAllobjectivefunctioncoefficientsarenonnegativeAlgorithm:BalasAdditiveAlgorithm1Standardizetheproblemtotheform:MinZ=∑j∈NCjxjs.
t∑j∈Naijxj≤biforalli∈M.
whereM={1,2,…m}andN={1,2,…n}xj={0,1},forallj∈N2SetaninitialupperboundtoZ=+∞,seti=0,andJ={}.
3SelectthenextpartialsolutionJ,solvetheLPiofJandattempttofathomusingoneofthethreeconditionslistedbelow.
a.
Allcompletionviolatesoneormoreconstraints.
i.
ecomputei.
A={j:j∈N-J,aij≥0foralli∈MsuchthatSi≤0}ii.
N1=N–J–AIfNI={}thenfathomthepartialsolutionJb.
Allcompletionareinferiortotheincumbentz'i.
ecomputei.
B={j:j∈N1,Z+Cj≥Z'}ii.
N2=N1–BIfN2={}thenfathompartialsolutionJc.
IfconstraintiisviolatedbythezerocompletionofthepartialsolutionsothatSi{}thenfathomthepartialsolutionJIfallthefathomtestfail,Gotostep64.
Ifbettersolutionisfound,thenupdateZ5IfallelementsofJisfathomedi.
eunderlined,thenZisoptimalGotostep7ElsesetJJ,{-j}andrepeatfromstep36Performbranchingby:i)Selectfreevariableforforwardstepii)SetJJ,{+j}Seti=i+1andrepeatstep37Terminate3.
1.
2.
TORAOneofthepowerfulfeaturesofTORAisitsgraphicaluserinterface(GUI)whichenablesuserstoexpresstheirproblemsinanaturalwaythatisverysimilartostandardmathematicalnotation.
ThisfeatureofGUIallowsuserstochoosethenextactionbeingmenudriven.
Thisoffersflexibilitytouserstoincreaseordecreasethedatasizeortoremoveaparticularvariablecompletely.
TORAoptimizationsolverhasthefollowingattributes:a.
Sets,whichcompriseofobjectsinprogrammingmodelb.
Objectivefunctionoftheproblemc.
ConstraintsofProblemd.
inputdataJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org554IMPLEMENTATIONANDRESULT4.
1FormatofinputdataInthispaper,theinputis38x380-1matrixwherecolumn2-38representseachcoveringandrow2-38representseachward.
Therefore,foreachcolumnandrow,theelementis1ifthewardiscoveredand0ifnotcovered.
E.
gthenameofthematrixisa,ifa[2][3]=1,itimpliesthatward3iscoveredbycovering2,otherwiseitisnotcoveredandthevaluewillbe0.
Thewholeinputfileformatforthisworkisshowninfigure4.
Theformatoftheoutputisinformofasolutionvectorcontainingonlyzerosandonesi.
e.
1ifacoveringisselectedand0ifnotselected.
Eachcoveringhasspecificnameofwardscoveringotherwardsthatarewithinthespecifieddistance.
(Thenameofeachwardandthenumberattachedtothemisshowninfigure3.
Figure3NamesofwardsandtheirnumberofidentificationTheinputmatrixshowninfigure4aandfigure4bwassavedastextfileandthebalasadditivealgorithmwasimplementedusingJavaprogramminglanguage.
Figure4aInputFileFormat1Obantoko,2Ikija,3Agooko,4ElegaHousing,5Iberekodo,6Agoika,7Ayetoro,8Okeago,9Totoro,10Itaosin,11Olorunda,12ImalaOrile,13IbaraOrile,14Ilewo/isaga,15Itaota,16Alagbagba,17Alabata,18Osiele,19Olodo,20Ilugun,21Agoodo,22Opeji,23Odeda,24Itesi,25Lafenwa,26Saje,27Itoko,28Ake,29Lantoro,30Ijemo,31Iporosodeke,32Irunbe,33Ijaye,34Okeitoku,35IjehunTitun,36Sabo,37Panseke.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org56Figure4bInputFileFormatOncetheinputfilehasbeenselected,andthentheprogramcanberuntogeneratetheoutputrequired.
Theresultaftertheclickofthe"run"buttonisshowninfigure5below.
Figure5SetCoveringoutput.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org57Thebalasadditiveresultaboveshowedthatcoveringisfoundandalsodisplayedthesolutionvector.
Itindicatedthatsixfirestationsareneededtoserveallthewardsandthelocationsofthosestationsareclearlystated.
ThesameresultwasobtainedfromTORAsoftwareintermsofoptimality,butthelocationsaredifferentandnotclearlystatedthoughitcanbetracedout.
Figure6ResultfromTORAsolverFigure6showstheresultoftheTORAsolver,theresultsissuchthatsixfirestationsarealsoneededtoserveallthewardseffectivelybutthelocationsofthefireservicestationarequitedifferentfromthatofBALASalgorithmthatwasimplemented.
Thelocationsindicatedbythesolverarelocations11,14,17,19,21,24whichcorrespondstothenamesofthefollowingwards(Olorunda,IlewoIsaga,alabata,Olodo,Ago-OdoandItesi)asshowninfigure3.
Torasolverdoesnotlistthenamesornumbersofthevillagesinitscovering.
5DISCUSSIONThenecessityofthedevelopmentoffacilitieslocationsoftwareforenhancingthedecisionmakingprocessandeventuallyproductivitycannotbeover-emphasized.
Theresultsobtainedinthisworkshowedthatsixfirestationsareneededtoserveeverywardsuchthatthemaximumdistancethatafirestationservicecangois10kilometers.
ItalsoshowedthatthelocationofthestationshouldbeObantoko,Olorunda,Ibaraorile,Olodo,OpejiandOdeda.
ThefirestationsatObantokowillrenderservicestotwentyfivewardswhichare:Obantoko,Ikija,Ago-oko,Elega,iberekodo,Ago-Ika,Ayetoro,Oke-ago,totoro,Ita-osin,Ita-ota,Ago-odo,lafenwa,Saje,Itoko,Ake,Lantoro,Ijemo,Iporo-sodeke,irunbe,Ijaye,Oke-itoku,Ijeun-titun,SaboandPanseke.
Olorundaservicestationwillservetwowardswhichare:OlorundaandImala-Orile.
Ibara-OrileservicestationwillserveIbara-orileandIlewo-Isagarespectively.
Olodoservicestationwillservethreewards.
Theyare:alagbagba,OlodoandIlugun.
Opejiwillservefourwardswhichare:alabata,OsieleandOpeji.
FinallyodedastationwillserveOdedaandItesi.
ThoughtheresultfromTORAsolveralsoindicatedthatsixfirestationsareneeded,itdidnotspecifytheactuallocationswherethestationsshouldbelocated.
ThisshortcominginTORAmakesouroutputandimplementationabetterone.
Theseresultsarepresentedinthetablebelowformoreclarity.
Itshowsthelocationswherethefacilitiesaretobeinstalledandalsothevillagestobecoveredbyeachofthefacility(coverings)onlyforbalasadditivealgorithm.
Theoutputfrombalasadditivealgorithmdoesnotshowfairdistribution.
InthecaseofthefacilityinlocationObantokowhichistoserve25locationswhileothersserveminimumoftwolocationsandmaximumofthree.
ThefacilityinObantokowillbeoverused.
JournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org58Table1:OUTPUTOFBALASADDITIVEALGORITHMLocationidentificationnumberLocationnameCoverings1Obantoko1,2,3,4,5,6,7,8,9,10,15,21,25,26,27,28,29,30,31,32,33,34,35,36,3711Olorunda11,1213Ibaraorile13,1419Olodo16,19,2022Opeji17,18,2223Odeda23,24TABLE2:OUTPUTOFTORASOLVERLocationIdentificationNumberLocationNameCoverings11OlorundaNotindicated14Ilewo-IsagaNotindicated17AlabataNotindicated19OlodoNotindicated21Ago-odoNotindicated24ItesiNotindicated6CONCLUSIONSANDRECOMMENDATIONSThisresultthereforeshouldraiseawarenessandcontributetotheaimofourgovernmenttoadoptthistoolwhichwilldefinitelyimprovethefunctionalityoffirestationsinNigeriabysavingalotofcitizen'slivesandproperties.
Itshouldalsobenotedthattheuseofthissystemisnotlimitedonlytofirestationsallocationalone,butalsotootherpublicfacilitieslikeschools,policestationsoastoincreaseresponsetimeandthereforereducecrime.
Itcanalsobeusedbyprivateestablishments.
REFERENCES[1]J.
EBeasleyandP.
C.
Chu,"Ageneticalgorithmforthesetcoveringproblem",EuropeanJournalofOperationalResearch,vol.
94,1996,pp.
392-404.
[2]V.
Chvatal.
Agreedyheuristicforthesetcoveringproblem.
MathematicsofOperationResearch,4(3):233-235,1979.
[3]U.
Fiege.
Athresholdforlnnforapproximatingsetcover.
JournaloftheACM,45(4):634-652,July1998.
[4]D.
S.
Johnson.
Approximationalgorithmsforcombinatorialproblems.
J.
Compute.
SystemScience9:256-278,1974.
[5]LarsonRichardC.
,"AHypercubeQueuingModelforfacilitylocationandredistrictinginurbanemergencyservices",ComputersandOperationsResearch1(1974)67-95.
[6]SavasES,"Simulationandcost-effectivenessanalysisofNewYork'semergencyambulanceservice",ManagementScience14(1969)608-627.
[7]M.
L.
FisherandP.
Kedia.
OptimalSolutionofsetcoveringproblemsusingdualheuristics.
ManagementScience,36:674-688,1990.
[8]FeoA.
andG.
C.
MauricioandA.
Resende,(2002)"AProbabilisticHeuristicforaComputationallyDifficultSetCoveringProblem",OperationsResearchLetters,8,67-71.
[9]A.
Caparara,M.
Fischetti,andP.
Toth.
AlgorithmsforsetcoverinproblemstechnicalreportOR-98-3,DEIS,UniversityofBologna,Italy1998.
[10]N.
ChristofidesandJ.
PPaixao.
Algorithmsforlargescalesetcoveringproblems.
AnnalsofOperationResearch,43:261-277,1993.
[11]M.
JBrusco,L.
W.
Jacobs,andG.
MThompson.
Amorphingproceduretosupplementasimulatedannealingheuristicsforcostandcoverage-correlatedsetcoveringproblems.
AnnalsofOperationResearch,86:611-627,1999.
[12]ToregasC.
,SwainR.
,RevelleC.
,andBergmanL.
,(1988)"ThelocationofJournalofTheoreticalandAppliedInformationTechnology2005-2009JATIT.
Allrightsreserved.
www.
jatit.
org59emergencyservicefacilities",Operationresearch19,pg1363-1373.
[13]ChurchRichardL.
,GerardRossa.
,(2003)"Themultilevellocationsetcoveringmodel"GeographicalAnalysisPublication,pg76-79.
[14]GareyM.
R.
andJohnsonD.
S.
,(2005)"Computerandinteractability:aguidetothetheoryofNP-completeness",pg34-38.
[15]Handya.
Taha.
,(2005)'OperationResearch:Anintroduction",Pearsoneducation(Singapore)Pte.
Ltd.
,pg391-397.
[16]Danielgulotta,(2006)"ApplicationoflinearProgrammingtosetcoveringandrelatedproblems"OnlinejournalofOperationResearch,pg1-2.
Megalayer促销：美国圣何塞CN2线路VPS月付48元起/香港VPS月付59元起/香港E3独服月付499元起
Megalayer是新晋崛起的国外服务器商，成立于2019年，一直都处于稳定发展的状态，机房目前有美国机房，香港机房，菲律宾机房。其中圣何塞包括CN2或者国际线路，Megalayer商家提供了一些VPS特价套餐，譬如15M带宽CN2线路主机最低每月48元起，基于KVM架构，支持windows或者Linux操作系统。。Megalayer技术团队行业经验丰富，分别来自于蓝汛、IBM等知名企业。Mega...
iON Cloud：新加坡cn2 gia vps/1核/2G内存/25G SSD/250G流量/10M带宽,$35/月
iON Cloud怎么样?iON Cloud升级了新加坡CN2 VPS的带宽和流量最低配的原先带宽5M现在升级为10M，流量也从原先的150G升级为250G。注意，流量也仅计算出站方向。iON Cloud是Krypt旗下的云服务器品牌，成立于2019年，是美国老牌机房(1998~)krypt旗下的VPS云服务器品牌，主打国外VPS云服务器业务，均采用KVM架构，整体性能配置较高，云服务器产品质量靠...
Buyvm：VPS/块存储补货1Gbps不限流量/$2起/月
BuyVM测评，BuyVM怎么样？BuyVM好不好？BuyVM，2010年成立的国外老牌稳定商家，Frantech Solutions旗下，主要提供基于KVM的VPS服务器，数据中心有拉斯维加斯、纽约、卢森堡，付费可选强大的DDOS防护（月付3美金），特色是1Gbps不限流量，稳定商家，而且卢森堡不限版权。1G或以上内存可以安装Windows 2012 64bit，无需任何费用，所有型号包括免费的...
solved为你推荐
-
域名空间代理现在代理域名空间赚钱吗域名注册网有没有免费的网站域名注册？国外虚拟主机国外虚拟主机速度怎么样？免费国内空间现在国内比较好的免费网站空间有那个啊？网站服务器租用个人网站服务器租用一年多少钱美国vps主机我用的美国VPS主机429元/月，感觉好贵，请问有比较便宜点的吗？网站空间商域名空间商怎么做万网虚拟主机万网虚拟主机可以做几个网站郑州虚拟主机什么是双线虚拟主机？最好的虚拟主机哪家的虚拟主机比较好？