The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
A simulated annealing heuristic for the capacitated location routing problem
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Self-citationComplexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Complexity of vehicle routing and scheduling problems
Lenstra, J. K., & Kan, A. H. G. R. (1981) · Networks · doi:10.1002/net.3230110211 · Cited by 1,325
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
Cornuejols, G., Fisher, M. L., & Nemhauser, G. L. (1977) · Management Science · doi:10.1287/mnsc.23.8.789 · Cited by 793
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
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
Cornuéjols, G., Fisher, M. L., & Nemhauser, G. L. (1979) · Management Science · doi:10.1287/mnsc.25.8.808 · Cited by 432
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
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 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
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
Bouhafs, L., Hassani, A. H. E., & Koukam, A. (2006) · Lecture notes in computer science · doi:10.1007/11892960_50 · Cited by 46
Cited by
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 variants and extensions of the location-routing problem
Drexl, M., & Schneider, M. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.08.030 · Cited by 465
A case analysis of a sustainable food supply chain distribution system—A multi-objective approach
Validi, S., Bhattacharya, A., & Byrne, P. J. (2014) · International Journal of Production Economics · doi:10.1016/j.ijpe.2014.02.003 · Cited by 276
Metadata
- Authors
- Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J.
- Venue
- Computers & Industrial Engineering
- Publisher
- Elsevier BV
- Published
- 2010-03
- Volume
- 58
- Issue
- 2
- Pages
- 288-299
- ISSN
- 0360-8352 (ISSN-L)
- OpenAlex
- W2015785429
- Cited by
- 287
- References
- 18
- FWCI
- 35.45
- 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.