The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Knowles, J. D., & Corne, D. W. (2000) · Evolutionary Computation · doi:10.1162/106365600568167 · Cited by 2,286
Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., & Price, K. V. (1999) · Cited by 2,136
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Management Models and Industrial Applications of Linear Programming
Charnes, A., & Cooper, W. W. (1957) · Management Science · doi:10.1287/mnsc.4.1.38 · Cited by 1,902
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
Desrochers, M., Desrosiers, J., & Solomon, M. (1992) · Operations Research · doi:10.1287/opre.40.2.342 · Cited by 1,197
Optimal Estimation of Executive Compensation by Linear Programming
Charnes, A., Cooper, W. W., & Ferguson, R. O. (1955) · Management Science · doi:10.1287/mnsc.1.2.138 · Cited by 1,092
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
Probabilistic diversification and intensification in local search for vehicle routing
Rochat, Y., & Taillard, É. D. (1995) · Journal of Heuristics · doi:10.1007/bf02430370 · Cited by 914
A unified tabu search heuristic for vehicle routing problems with time windows
Cordeau, J.-F., Laporte, G., & Mercier, A. (2001) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601163 · Cited by 897
Genetic Algorithms + Data Structures = Evolution Programs
Rocke, D. M., & Michalewicz, Z. (2000) · Journal of the American Statistical Association · doi:10.2307/2669583 · Cited by 880
Classical and modern heuristics for the vehicle routing problem
Laporte, G. (2000) · International Transactions in Operational Research · doi:10.1016/s0969-6016(00)00003-4 · Cited by 759
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
Gambardella, L. M., Taillard, É. D., & Agazzi, G. (1999) · Cited by 725
VEHICLE ROUTING: METHODS AND STUDIES
Golden, B., & Assad, A. A. (1988) · North-Holland eBooks · Cited by 691
Genetic algorithms + data structures = evolution programs
Bousonville, T. (1997) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(97)87028-4 · Cited by 665
Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b101915 · Cited by 545
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
Ombuki, B., Ross, B. J., & Hanshar, F. (2006) · Applied Intelligence · doi:10.1007/s10489-006-6926-z · Cited by 518
Handbook of critical issues in goal programming
Pastijn, H. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90252-5 · Cited by 498
Waste collection vehicle routing problem with time windows
Kim, B., Kim, S., & Sahoo, S. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.02.045 · Cited by 419
Simulated annealing metaheuristics for the vehicle routing problem with time windows
Chiang, W.-C., & Russell, R. A. (1996) · Annals of Operations Research · doi:10.1007/bf02601637 · Cited by 354
Dondo, R., & Cerdá, J. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.07.077 · Cited by 313
Heuristic methods for vehicle routing problem with time windows
Tan, K. C., Lee, L. H., Zhu, Q. L., & Ou, K. (2001) · Artificial Intelligence in Engineering · doi:10.1016/s0954-1810(01)00005-x · Cited by 310
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms
Blanton, J. L., & Wainwright, R. L. (1993) · international conference on Genetic algorithms · Cited by 212
Management Models and Industrial Applications of Linear Programming.
Jacobs, W. W., Charnes, A., & Cooper, W. W. (1962) · Journal of the American Statistical Association · doi:10.2307/2281833 · Cited by 193
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Backer, B. D., Furnon, V., Shaw, P., Kilby, P., & Prosser, P. (2000) · Journal of Heuristics · doi:10.1023/a:1009621410177 · Cited by 183
A new hybrid genetic algorithm for the capacitated vehicle routing problem
Berger, J., & Barkaoui, M. (2003) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601635 · Cited by 116
A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem
Berger, J., & Barkaoui, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-45105-6_80 · Cited by 112
Sequential search and its application to vehicle-routing problems
Irnich, S., Funke, B., & Grünert, T. (2005) · Computers & Operations Research · doi:10.1016/j.cor.2005.02.020 · Cited by 90
Cited by
The vehicle routing problem: State of the art classification and review
Braekers, K., Ramaekers, K., & Van Nieuwenhuyse, I. (2016) · Computers & Industrial Engineering · doi:10.1016/j.cie.2015.12.007 · Cited by 1,265
Metadata
- Authors
- Ghoseiri, K., & Ghannadpour, S. F.
- Venue
- Applied Soft Computing
- Publisher
- Elsevier BV
- Published
- 2010-09
- Volume
- 10
- Issue
- 4
- Pages
- 1096-1107
- ISSN
- 1568-4946 (ISSN-L)
- OpenAlex
- W1978111418
- Cited by
- 282
- References
- 33
- FWCI
- 32.43
- 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.