References
- Albareda-SambolaMFernándezELaporteGHeuristic and lower bound for a stochastic location-routing problemEuropean Journal of Operational Research2007179394095510.1016/j.ejor.2005.04.051
- Alçada-AlmeidaLTralhäoLSantosLCoutinho-RodriguesJA multiobjective approach to locate emergency shelters and identify evacuation routes in urban areasGeographical Analysis200941192910.1111/j.1538-4632.2009.00745.x
- AlumurSKaraBYA new model for the hazardous waste location-routing problemComputers and Operations Research20073451406142310.1016/j.cor.2005.06.012
- BalakrishnanAWardJEWongRTIntegrated facility location and vehicle routing models: Recent work and future prospectsAmerican Journal of Mathematical and Management Sciences198771356110.1080/01966324.1987.10737207
- BérubéJFGendreauMPotvinJYAn exact-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profitsEuropean Journal of Operational Research20091941395010.1016/j.ejor.2007.12.014
- Blincoe L et al (2002). The economic impact of motor vehicle crashes, 2000. Crash Statistics DOT HS 809 446, NHTSA.
- BoussierSFeilletDGendreauMAn exact algorithm for team orienteering problems4OR: A Quarterly Journal of Operations Research20075321123010.1007/s10288-006-0009-1
- CaballeroRGonzálezMGuerreroFMMolinaJParaleraCSolving a multiobjective location routing problem with a metaheuristic based on tabu search; Application to a real case in AndalusiaEuropean Journal of Operational Research200717731751176310.1016/j.ejor.2005.10.017
- ChankongVHaimesYYMultiobjective Decision Making: Theory and Methodology1983
- CrainicTGGendreauMRousseauL-MSpecial issue on recent advances in metaheuristicsJournal of Heuristics201016323523710.1007/s10732-010-9132-4
- GoldenBSkiscimCUsing simulated annealing to solve routing and location problemsNaval Research Logistics Quarterly198633226127910.1002/nav.3800330209
- HansenPHHegedahlBHjortkjaerSObelBA heuristic solution to the warehouse location-routing problemEuropean Journal of Operational Research199476111112710.1016/0377-2217(94)90010-8
- KeskinBBLiSRSteilDSpillerSAnalysis of an integrated maximum covering and patrol routing problemTransportation Research Part E: Logistics and Transportation Review201248121523210.1016/j.tre.2011.07.005
- KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
- LabbéMRodrguez-MartinISalazar-GonzálezJJA branch-and-cut algorithm for the plant-cycle location problemJournal of the Operational Research Society200455551352010.1057/palgrave.jors.2601692
- LaporteGLocation-routing problemsVehicle Routing: Methods and Studies1988163198
- LaporteGNobertYArpinDAn exact algorithm for solving a capacitated location-routing problemAnnals of Operations Research19866929131010.1007/BF02023807
- Laumanns M, Thiele L and Zitzler E (2005). An adaptive scheme to generate the pareto front based on the epsilon-constraint method. In: Branke J, Deb K, Miettinen K and Steuer RE (eds). Practical Approaches to Multi-Objective Optimization. Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany.
- LaumannsMThieleLZitzlerEAn efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint methodEuropean Journal of Operational Research2006169393294210.1016/j.ejor.2004.08.029
- LinS-WYuVFA simulated annealing heuristic for the team orienteering problem with time windowsEuropean Journal of Operational Research201221719410710.1016/j.ejor.2011.08.024
- LouYYinYLawphongpanichSFreeway service patrol deployment planning for incident management and congestion mitigationTransportation Research Part C: Emerging Technologies201119228329510.1016/j.trc.2010.05.014
- MavrotasGEffective implementation of the ɛ-constraint method in multi-objective mathematical programming problemsApplied Mathematics and Computation2009213245546510.1016/j.amc.2009.03.037
- MelechovskýJPrinsCCalvoRWA metaheuristic to solve a location-routing problem with non-linear costsJournal of Heuristics200511537539110.1007/s10732-005-3601-1
- MiettinenKNonlinear Multiobjective Optimization1999
- MinHJayaramanVSrivastavaRCombined location-routing problems: A synthesis and future research directionsEuropean Journal of Operational Research1998108111510.1016/S0377-2217(97)00172-0
- MontemanniRGambardellaLMAnt colony system for team orienteering problems with time windowsFoundations of Computing and Decision Sciences2009344287306
- NagyGSalhiSNested heuristic methods for the location-routeing problemJournal of the Operational Research Society19964791166117410.1057/jors.1996.144
- NagyGSalhiSLocation-routing: Issues, models and methodsEuropean Journal of Operational Research2007177264967210.1016/j.ejor.2006.04.004
- OsmanIHMetastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research199341442145110.1007/BF02023004
- PerlJDaskinMSA warehouse location-routing problemTransportation Research Part B: Methodological198519538139610.1016/0191-2615(85)90052-9
- SaitSMYoussefHIterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems1999
- SalhiSRandGKThe effect of ignoring routes when locating depotsEuropean Journal of Operational Research198939215015610.1016/0377-2217(89)90188-4
- SemetFTaillardESolving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research199341446948810.1007/BF02023006
- SteilDParrishAHit: A gis-based hotspot identification taxonomyInternational Journal of Computers and Their Applications20091628190
- TricoireFRomauchMDoernerKFHartlRFHeuristics for the multi-period orienteering problem with multiple time windowsComputers and Operations Research201037235136710.1016/j.cor.2009.05.012
- TsiligiridesTHeuristic methods applied to orienteeringJournal of the Operational Research Society198435979780910.1057/jors.1984.162
- VansteenwegenPSouffriauWVanden BergheGVan OudheusdenDIterated local search for the team orienteering problem with time windowsComputers and Operations Research200936123281329010.1016/j.cor.2009.03.008
- WillemseEJJoubertJWApplying min–max k postmen problems to the routing of security guardsJournal of the Operational Research Society201263224526010.1057/jors.2011.26
- WuTHLowCBaiJWHeuristic solutions to multi-depot location-routing problemsComputers and Operations Research200229101393141510.1016/S0305-0548(01)00038-7
- YuVFLinS-WLeeWTingC-JA simulated annealing heuristic for the capacitated location routing problemComputers and Industrial Engineering201058228829910.1016/j.cie.2009.10.007