{"doi":"10.1016/j.cie.2013.07.025","title":"Local search techniques for a routing-packing problem","abstract":null,"journal":"Computers & Industrial Engineering","year":2013,"id":34591,"datarank":2.9733684236271585,"base_score":4.204692619390966,"endowment":4.204692619390966,"self_citation_contribution":0.6307038929086449,"citation_network_contribution":2.3426645307185137,"self_endowment_contribution":0.6307038929086449,"citer_contribution":2.3426645307185137,"corpus_percentile":null,"corpus_rank":null,"citation_count":66,"citer_count":64,"citers_with_citation_signal":53,"citers_with_endowment":53,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":178913,"name":"Andrea Schaerf","orcid":null,"position":1,"is_corresponding":false},{"id":178914,"name":"Thomas Stützle","orcid":null,"position":2,"is_corresponding":false},{"id":178912,"name":"Sara Ceschia","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":4.204692619390966,"endowment":4.204692619390966,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2002914572","authors":[],"funders":[],"total_grants":0,"fwci":6.9891,"citation_percentile":0.96193026,"influential_citations":8,"citation_trend":[{"year":2014,"count":2},{"year":2015,"count":4},{"year":2016,"count":4},{"year":2017,"count":4},{"year":2018,"count":2},{"year":2019,"count":3},{"year":2020,"count":6},{"year":2021,"count":8},{"year":2022,"count":7},{"year":2023,"count":4},{"year":2024,"count":14},{"year":2025,"count":6},{"year":2026,"count":2}],"oa_status":"closed","license":null,"oa_locations":[{"url":"https://api.elsevier.com/content/article/PII:S0360835213002404?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0360835213002404?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1016/j.cie.2013.07.025","host_type":"journal"},{"url":"http://hdl.handle.net/11390/892741","host_type":"repository"},{"url":"https://dipot.ulb.ac.be/dspace/bitstream/2013/168284/1/Elsevier_151914.pdf","host_type":"repository"}],"fields_of_study":["Optimization and Packing Problems","Vehicle Routing Optimization Methods","Advanced Manufacturing and Logistics Optimization","Engineering","Computer Science","Business"],"mesh_terms":[],"keywords":["Vehicle routing problem","Solver","Mathematical optimization","Simulated annealing","Computer science","Extension (predicate logic)","Routing (electronic design automation)","Set (abstract data type)","Packing problems","Problem solver","Mathematics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Industry, innovation and infrastructure"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-09T19:11:42.142129Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}