The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
A survey of variants and extensions of the location-routing problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
(2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718515 · Cited by 4,008
The Theory and Practice of Revenue Management
Talluri, K. T., & Van Ryzin, G. J. (2004) · International Series in Operations Research & Management Science · doi:10.1007/b139000 · Cited by 2,243
Design and Analysis of Experiments: Special Designs and Applications
(2012) · Wiley Series in Probability and Statistics · doi:10.1002/9781118147634 · Cited by 2,031
(2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5 · Cited by 1,642
The Vehicle Routing Problem: Latest Advances and New Challenges
(2008) · Operations Research/Computer Science Interfaces · doi:10.1007/978-0-387-77778-8 · Cited by 1,483
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
A simple and effective evolutionary algorithm for the vehicle routing problem
Prins, C. (2004) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00158-8 · Cited by 1,058
Location-routing: Issues, models and methods
Nagy, G., & Salhi, S. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.04.004 · Cited by 979
A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
Taillard, É. D., Badeau, P., Michel Gendreau, A., Guertin, F., & Potvin, J. (1997) · Transportation Science · doi:10.1287/trsc.31.2.170 · Cited by 957
A General Approximation Technique for Constrained Forest Problems
Goemans, M. X., & Williamson, D. P. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793242618 · Cited by 884
A tabu search heuristic for periodic and multi-depot vehicle routing problems
Cordeau, J.-F., Gendreau, M., & Laporte, G. (1997) · Networks · doi:10.1002/(sici)1097-0037(199709)30:2<105::aid-net5>3.0.co;2-g · Cited by 864
Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008) · Journal für Betriebswirtschaft · doi:10.1007/s11301-008-0036-4 · Cited by 858
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Magnanti, T. L., & Wong, R. T. (1981) · Operations Research · doi:10.1287/opre.29.3.464 · Cited by 731
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014) · International Journal of Production Economics · doi:10.1016/j.ijpe.2013.12.028 · Cited by 649
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
Another proof of the defect relation for moving targets
Shirosaki, M. (1991) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178227459 · Cited by 614
Pricing and Revenue Optimization
Phillips, R. (2005) · Stanford University Press eBooks · doi:10.1515/9780804781640 · Cited by 602
Padberg, M. (1980) · Mathematical programming studies · doi:10.1007/bfb0120883 · Cited by 577
Shekhar, S., Xiong, H. Y., & Zhou, X. S. (2017) · Encyclopedia of GIS · doi:10.1007/978-3-319-17885-1_101452 · Cited by 568
The Theory and Practice of Revenue Management
Lieberman, W. (2005) · Journal of Revenue and Pricing Management · doi:10.1057/palgrave.rpm.5170123 · Cited by 525
Pricing and revenue optimization
(2002) · Work Study · doi:10.1108/ws.2002.07951gaf.007 · Cited by 509
Combined location-routing problems: A synthesis and future research directions
Min, H., Jayaraman, V., & Srivastava, R. (1998) · European Journal of Operational Research · doi:10.1016/s0377-2217(97)00172-0 · Cited by 486
Baldacci, R., Mingozzi, A., & Roberti, R. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.07.037 · Cited by 474
A Computational Study of Search Strategies for Mixed Integer Programming
Linderoth, J., & Savelsbergh, M. W. P. (1999) · INFORMS journal on computing · doi:10.1287/ijoc.11.2.173 · Cited by 376
A two-phase tabu search approach to the location routing problem
Aksu, D. T., & Burke, L. I. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00107-6 · Cited by 369
Using clustering analysis in a capacitated location-routing problem
Barreto, S., Ferreira, C., Paixão, J. M. P., & Santos, B. S. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.06.074 · Cited by 363
Heuristic solutions to multi-depot location-routing problems
Wu, T.-H., Low, C., & Bai, J.-W. (2002) · Computers & Operations Research · doi:10.1016/s0305-0548(01)00038-7 · Cited by 351
Experimental Methods for the Analysis of Optimization Algorithms
(2010) · Springer eBooks · doi:10.1007/978-3-642-02538-9 · Cited by 333
Dondo, R., & Cerdá, J. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.07.077 · Cited by 313
A simulated annealing heuristic for the capacitated location routing problem
Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.10.007 · Cited by 287
Incorporating location, routing and inventory decisions in supply chain network design
Javid, A. A., & Azad, N. (2009) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2009.06.005 · Cited by 282
Prins, C., Prodhon, C., Ruiz, A. B., Patrick Soriano, A., & Calvo, R. W. (2007) · Transportation Science · doi:10.1287/trsc.1060.0187 · Cited by 271
A theoretician’s guide to the experimental analysis of algorithms
Johnson, D. (2002) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/059/11 · Cited by 261
A math-heuristic for the warehouse location–routing problem in disaster relief
Rath, S., & Gutjahr, W. J. (2014) · Computers & Operations Research · doi:10.1016/j.cor.2011.07.016 · Cited by 245
Nguyen, V., Prins, C., & Prodhon, C. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.07.030 · Cited by 222
A compact model and tight bounds for a combined location-routing problem
Albareda-Sambola, M., Díaz, J. A., & Fernández, E. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00245-4 · Cited by 191
Nguyen, V., Prins, C., & Prodhon, C. (2011) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2011.09.012 · Cited by 165
Caballero, R., González, M., Guerrero, F., Molina, J., & Morales, C. P. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.10.017 · Cited by 157
Lin, C. K. Y., & Kwok, R. C. W. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.10.032 · Cited by 128
A location-routing problem for the conversion to the “click-and-mortar” retailing: The static case
Aksen, D., & Altınkemer, K. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.01.048 · Cited by 102
Operations Research Proceedings 2006
Waldmann, K.-H., & Stocker, U. M. (2007) · Springer eBooks · doi:10.1007/978-3-540-69995-8 · Cited by 101
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
Molina, J., Laguna, M., Martí, R., & Caballero, R. (2007) · INFORMS journal on computing · doi:10.1287/ijoc.1050.0149 · Cited by 99
Operations Research and Cyber-Infrastructure
Sharda, R., Chinneck, J. W., Saltzman, M. J., et al. (2009) · Springer eBooks · doi:10.1007/978-0-387-88843-9 · Cited by 98
A new formulation and an exact approach for the many-to-many hub location-routing problem
de Camargo, R. S., de Miranda, G., & Løkketangen, A. (2013) · Applied Mathematical Modelling · doi:10.1016/j.apm.2013.02.035 · Cited by 98
Gold, T. C. A. H. (2008) · InTech eBooks · doi:10.5772/62148 · Cited by 72
Silberholz, J., & Golden, B. (2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1665-5_21 · Cited by 71
Multi-level supply chain network design with routing
Lee, J. H., Moon, I., & Park, J.-H. (2009) · International Journal of Production Research · doi:10.1080/00207540902922851 · Cited by 68
A location-routing-inventory model for designing multisource distribution networks
Javid, A. A., & Seddighi, A. H. (2011) · Engineering Optimization · doi:10.1080/0305215x.2011.600756 · Cited by 61
A decision-support tool for a capacitated location-routing problem
Lopes, R. B., Barreto, S., Ferreira, C., & Santos, B. S. (2008) · Decision Support Systems · doi:10.1016/j.dss.2008.07.007 · Cited by 59
Tavakkoli-Moghaddam, R. R., Makui, A., & Mazloomi, Z. (2010) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2010.11.005 · Cited by 51
Improving the Performance of Heuristic Algorithms Based on Causal Inference
Quiróz-Castellanos, M., Cruz–Reyes, L., Torres-Jiménez, J., et al. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25324-9_12 · Cited by 3
Cited by
Last-mile delivery concepts: a survey from an operational research perspective
Boysen, N., Fedtke, S., & Schwerdfeger, S. (2021) · OR Spectrum · doi:10.1007/s00291-020-00607-8 · Cited by 621
The electric location routing problem with time windows and partial recharging
Schiffer, M., & Walther, G. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.01.011 · Cited by 343
Hof, J., Schneider, M., & Goeke, D. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.11.009 · Cited by 284
Self-citation
Metadata
- Authors
- Drexl, M., & Schneider, M.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2015-03
- Volume
- 241
- Issue
- 2
- Pages
- 283-308
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W2008477533
- Cited by
- 465
- References
- 53
- FWCI
- 52.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.