{"id":"https://openalex.org/W2300436762","doi":null,"title":"A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS","display_name":"A HEURISTIC ALGORITHM AND A LOWER BOUND FOR THE TWO-ECHELON LOCATION-ROUTING PROBLEM WITH SOFT TIME WINDOW CONSTRAINTS","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2300436762","mag":"2300436762"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.848.4651","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.848.4651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sid.ir/en/VEWSSID/J_pdf/95520101E07.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://scientiairanica.sharif.edu/article_3323_914c872ce83884ecb171cbce20a7717b.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047770946","display_name":"Ehsan Nikbakhsh","orcid":"https://orcid.org/0000-0002-5872-9756","observed_orcids":["https://orcid.org/0000-0002-5872-9756"]},"institutions":[{"id":"https://openalex.org/I1516879","display_name":"Tarbiat Modares University","ror":"https://ror.org/03mwgfy56","country_code":"IR","type":"education","lineage":["https://openalex.org/I1516879"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ehsan Nikbakhsh","raw_affiliation_strings":["Department of Industrial engineering, Tarbiat Modares University"],"raw_orcid":"https://orcid.org/0000-0002-5872-9756","affiliations":[{"raw_affiliation_string":"Department of Industrial engineering, Tarbiat Modares University","institution_ids":["https://openalex.org/I1516879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060428416","display_name":"Zegordi S.H.A.D.","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1516879","display_name":"Tarbiat Modares University","ror":"https://ror.org/03mwgfy56","country_code":"IR","type":"education","lineage":["https://openalex.org/I1516879"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Zegordi S.H.A.D.","raw_affiliation_strings":["Tarbiat Modares University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tarbiat Modares University","institution_ids":["https://openalex.org/I1516879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1516879"],"apc_list":null,"apc_paid":null,"fwci":0.95,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.84913601,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"17","issue":"1","first_page":"36","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/two-echelon-location-routing-problem","display_name":"two-echelon location-routing problem","score":0.984000027179718},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.8159999847412109},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.9950000047683716},{"id":"https://openalex.org/keywords/neighborhood-search","display_name":"neighborhood search","score":0.7850000262260437},{"id":"https://openalex.org/keywords/integrated-logistics-systems","display_name":"integrated logistics systems","score":0.8299999833106995},{"id":"https://openalex.org/keywords/facility-location","display_name":"facility location","score":0.8040000200271606}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7979993224143982},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7004451751708984},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6766682863235474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093332767486572},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5628693103790283},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5418712496757507},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.4803008437156677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3925398886203766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2926807999610901},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.848.4651","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.848.4651","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sid.ir/en/VEWSSID/J_pdf/95520101E07.pdf","raw_type":"text"},{"id":"mag:2300436762","doi":null,"is_oa":true,"landing_page_url":"http://scientiairanica.sharif.edu/article_3323_914c872ce83884ecb171cbce20a7717b.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2498435459","display_name":"Scientia Iranica","issn_l":"1026-3098","issn":["1026-3098","2345-3605"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319005","host_organization_name":"Sharif University of Technology","host_organization_lineage":["https://openalex.org/P4310319005"],"host_organization_lineage_names":["Sharif University of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Scientia Iranica","raw_type":null}],"best_oa_location":{"id":"mag:2300436762","doi":null,"is_oa":true,"landing_page_url":"http://scientiairanica.sharif.edu/article_3323_914c872ce83884ecb171cbce20a7717b.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2498435459","display_name":"Scientia Iranica","issn_l":"1026-3098","issn":["1026-3098","2345-3605"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-20","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319005","host_organization_name":"Sharif University of Technology","host_organization_lineage":["https://openalex.org/P4310319005"],"host_organization_lineage_names":["Sharif University of Technology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Scientia Iranica","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W130189437","https://openalex.org/W195910675","https://openalex.org/W224294758","https://openalex.org/W614784322","https://openalex.org/W1965680834","https://openalex.org/W1984197114","https://openalex.org/W1995477767","https://openalex.org/W2011039300","https://openalex.org/W2015737965","https://openalex.org/W2017927472","https://openalex.org/W2024938364","https://openalex.org/W2031733044","https://openalex.org/W2035491675","https://openalex.org/W2038947920","https://openalex.org/W2040546552","https://openalex.org/W2040729418","https://openalex.org/W2044028040","https://openalex.org/W2058698701","https://openalex.org/W2058748455","https://openalex.org/W2072924020","https://openalex.org/W2090619991","https://openalex.org/W2095122546","https://openalex.org/W2133962824","https://openalex.org/W2153176832","https://openalex.org/W2168127659","https://openalex.org/W2169337137","https://openalex.org/W2300156188","https://openalex.org/W2503454859","https://openalex.org/W2994585251","https://openalex.org/W3036211873"],"related_works":["https://openalex.org/W3186976393","https://openalex.org/W2903571685","https://openalex.org/W1918085273","https://openalex.org/W2253864008","https://openalex.org/W2369979425","https://openalex.org/W2251342486","https://openalex.org/W2956133935","https://openalex.org/W2392693643","https://openalex.org/W4300509440","https://openalex.org/W2349429494"],"abstract_inverted_index":{"Abstract.":[0],"The":[1,77],"location-routing":[2,68],"problem":[3,84],"is":[4],"one":[5],"of":[6,24,98,114],"the":[7,18,66,83,99,103,107,112,115,119],"most":[8],"important":[9],"location":[10],"problems":[11,69],"for":[12,32,65],"designing":[13],"integrated":[14],"logistics":[15],"systems.":[16],"In":[17,48],"last":[19],"three":[20],"decades,":[21],"various":[22],"types":[23],"objective":[25],"function":[26],"and":[27,58,61,101],"constraints":[28,38,74],"have":[29,39],"been":[30],"considered":[31],"this":[33,49],"problem.":[34],"However,":[35],"time":[36,72],"window":[37,73],"received":[40],"little":[41],"attention,":[42],"despite":[43],"their":[44],"numerous":[45],"real-life":[46],"applications.":[47],"article,":[50],"a":[51,62],"new":[52],"4-index":[53],"mathematical":[54],"model,":[55],"an":[56,87],"ecient":[57],"fast":[59],"heuristic":[60,79],"lower":[63,121],"bound":[64],"two-echelon":[67],"with":[70],"soft":[71],"are":[75],"presented.":[76],"proposed":[78,116,120],"tries":[80],"to":[81],"solve":[82],"via":[85],"creating":[86],"initial":[88],"solution,":[89,100],"then":[90],"improving":[91],"it":[92],"by":[93],"searching":[94],"on":[95],"six":[96],"neighborhoods":[97],"using":[102,118],"Or-opt":[104],"heuristic.":[105],"At":[106],"end,":[108],"computational":[109],"results":[110],"show":[111],"eciency":[113],"heuristic,":[117],"bound.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2016-06-24T00:00:00"}